We present an approach based on integer programming formulations of the graph coloring problem. Our goal is to develop models that remove some symmetrical solutions obtained by color permutations. We study the problem from a polyhedral point of view and determine some families of facets of the 0/1-polytope associated with one of these integer programming formulations. The theoretical results described here are used to design an efficient Cutting Plane algorithm. © 2007 Elsevier B.V. All rights reserved.
Documento: | Artículo |
Título: | A cutting plane algorithm for graph coloring |
Autor: | Méndez-Díaz, I.; Zabala, P. |
Filiación: | Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina |
Palabras clave: | Cutting plane algorithms; Facets of polyhedra; Graph coloring; Integer programming; Computer programming; Graph theory; Integer programming; Problem solving; Cutting plane algorithms; Facets of polyhedra; Graph coloring; Algorithms |
Año: | 2008 |
Volumen: | 156 |
Número: | 2 |
Página de inicio: | 159 |
Página de fin: | 179 |
DOI: | http://dx.doi.org/10.1016/j.dam.2006.07.010 |
Título revista: | Discrete Applied Mathematics |
Título revista abreviado: | Discrete Appl Math |
ISSN: | 0166218X |
CODEN: | DAMAD |
PDF: | https://bibliotecadigital.exactas.uba.ar/download/paper/paper_0166218X_v156_n2_p159_MendezDiaz.pdf |
Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v156_n2_p159_MendezDiaz |