Facets of the graph coloring polytope
In this paper we present a study of the polytope associated to a classic linear integer programming formulation of the graph coloring problem. We determine some families of facets. This is the initial step for the development of a branch-and-cut algorithm to solve large instances of the graph colori...
Guardado en:
| Autores principales: | Coll, P., Marenco, J., Méndez Díaz, I., Zabala, P. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_02545330_v116_n1-4_p79_Coll |
| Aporte de: |
Ejemplares similares
-
Facets of the graph coloring polytope
por: Coll, Pablo Enrique, et al.
Publicado: (2002) -
A polyhedral approach for graph coloring
por: Méndez Díaz, I., et al. -
A polyhedral approach for graph coloring
por: Méndez Díaz, Isabel, et al.
Publicado: (2000) -
A cutting plane algorithm for graph coloring
por: Méndez-Díaz, I., et al.
Publicado: (2008) -
A cutting plane algorithm for graph coloring
por: Méndez-Díaz, I., et al.