Solving a multicoloring problem with overlaps using integer programming
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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | Argentina |
| Institución: | Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales |
| Repositorio: | Biblioteca Digital (UBA-FCEN) |
| Idioma: | inglés |
| OAI Identifier: | paperaa:paper_0166218X_v158_n4_p349_MendezDiaz |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v158_n4_p349_MendezDiaz |
| Access Level: | acceso abierto |
| Palabra clave: | Branch-and-Cut Graph multicoloring Integer programming Branch-and-cut Branch-and-cut algorithms Integer programming formulations Multicoloring Polytopes Random instance Valid inequality Dynamic programming Heuristic methods |
| Sumario: | 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. |
|---|