Multiprocessor scheduling under precedence constraints: Polyhedral results

Guardado en:

Detalles Bibliográficos
Publicado:	2006
Materias:	Multiprocessors Order polytopes Polyhedral combinatorics Precedence constraints Scheduling Valid inequalities Combinatorial mathematics Integer programming Problem solving Set theory
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v154_n5SPECISS_p770_Coll http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n5SPECISS_p770_Coll
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Multiprocessor scheduling under precedence constraints: Polyhedral results
por: Coll, P.E., et al.

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, Javier Leonardo
Publicado: (2006)

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, J., et al.
Publicado: (2006)

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, J., et al.

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, J., et al.
Publicado: (2006)

A polyhedral study of the maximum edge subgraph problem
por: Bonomo, Flavia, et al.
Publicado: (2012)

A polyhedral study of the maximum edge subgraph problem
por: Bonomo, F., et al.
Publicado: (2012)

A polyhedral study of the maximum edge subgraph problem
por: Bonomo, F., et al.

A polyhedral study of the maximum edge subgraph problem
por: Bonomo, F., et al.
Publicado: (2012)

Combinatorial equivalence of Chromatic Scheduling Polytopes
por: Marenco, Javier Leonardo
Publicado: (2004)

Combinatorial equivalence of Chromatic Scheduling Polytopes
por: Marenco, J., et al.

Cycle-based facets of chromatic scheduling polytopes
por: Marenco, Javier Leonardo
Publicado: (2009)

Cycle-based facets of chromatic scheduling polytopes
por: Marenco, J., et al.

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
por: Marenco, Javier Leonardo
Publicado: (2009)

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
por: Marenco, J., et al.
Publicado: (2009)

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
por: Marenco, J., et al.

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
por: Marenco, J., et al.
Publicado: (2009)

Polyhedral studies of vertex coloring problems: The standard formulation
por: Delle Donne, Diego, et al.
Publicado: (2016)

Polyhedral studies of vertex coloring problems: The standard formulation
por: Delle Donne, D., et al.

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
por: Marenco, Javier Leonardo
Publicado: (2007)

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
por: Marenco, J.L., et al.

The Football Pool Polytope
por: Marenco, Javier Leonardo
Publicado: (2008)

The Football Pool Polytope
por: Marenco, J.L., et al.

Combinatorics of 4-dimensional resultant polytopes
Publicado: (2013)

Combinatorics of 4-dimensional resultant polytopes
por: Dickenstein, A., et al.

Analysis of a generalized Linear Ordering Problem via integer programming
por: Vulcano, Gustavo, et al.
Publicado: (2024)

Computing the P 3 -hull number of a graph, a polyhedral approach
Publicado: (2019)

Computing the P 3 -hull number of a graph, a polyhedral approach
por: Blaum, M., et al.

Politopos de planificación cromática asociados al problema de asignación de frecuencias en sistemas de radio punto a multipunto
por: Marenco, Javier L.
Publicado: (2005)

Politopos de planificación cromática asociados al problema de asignación de frecuencias en sistemas de radio punto a multipunto
por: Marenco, Javier L.
Publicado: (2005)

Politopos de planificación cromática asociados al problema de asignación de frecuencias en sistemas de radio punto a multipunto
por: Marenco, Javier L.
Publicado: (2005)

Valid inequalities and complete characterizations of the 2-domination and P3-hull number polytope
por: Marenco, Javier, et al.
Publicado: (2023)

Un estudio poliedral del cálculo de los números P3-hull y de 2-dominación de un grafo
por: Blaum Akerman, Manuela
Publicado: (2022)

Un estudio poliedral del cálculo de los números P3-hull y de 2-dominación de un grafo
por: Blaum Akerman, Manuela
Publicado: (2022)

Un estudio poliedral del cálculo de los números P3-hull y de 2-dominación de un grafo
por: Blaum Akerman, Manuela
Publicado: (2022)

Facets based on cycles and cliques for the acyclic coloring polytope
por: Braga, Mónica Andrea, et al.
Publicado: (2025)

A shared-memory multiprocessor scheduling algorithm
por: Zuccar, Irene, et al.
Publicado: (2006)

Solving a multicoloring problem with overlaps using integer programming
por: Méndez Díaz, Isabel, et al.
Publicado: (2010)

Solving a multicoloring problem with overlaps using integer programming
por: Méndez-Díaz, I., et al.
Publicado: (2010)

Solving a multicoloring problem with overlaps using integer programming
por: Méndez-Díaz, I., et al.