This paper presents a new generalization of the graph multicoloring problem. We propose a Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used are valid inequalities that we could identify to the polytope associated with the model. The Branch-and-Cut system includes separation heuristics for the valid inequalities, specific initial and primal heuristics, branching and pruning rules. We report on computational experience with random instances. © 2009 Elsevier B.V. All rights reserved.
Documento: | Artículo |
Título: | Solving a multicoloring problem with overlaps using integer programming |
Autor: | Méndez-Díaz, I.; Zabala, P. |
Filiación: | Departamento de Computación, FCEyN - Universidad de Buenos Aires, Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina |
Palabras clave: | Branch-and-Cut; Graph multicoloring; Integer programming; Branch-and-cut; Branch-and-cut algorithms; Graph multicoloring; Integer programming formulations; Multicoloring; Polytopes; Random instance; Valid inequality; Dynamic programming; Heuristic methods; Integer programming |
Año: | 2010 |
Volumen: | 158 |
Número: | 4 |
Página de inicio: | 349 |
Página de fin: | 354 |
DOI: | http://dx.doi.org/10.1016/j.dam.2009.05.007 |
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_v158_n4_p349_MendezDiaz.pdf |
Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v158_n4_p349_MendezDiaz |