A cutting plane algorithm for graph coloring
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-p...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2008 |
| 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_v156_n2_p159_MendezDiaz |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v156_n2_p159_MendezDiaz |
| Access Level: | acceso abierto |
| Palabra clave: | Cutting plane algorithms Facets of polyhedra Graph coloring Integer programming Computer programming Graph theory Problem solving Algorithms |
| Sumario: | 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. |
|---|