A polyhedral approach for the equitable coloring problem
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows t...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/85989 |
| Acesso em linha: | http://hdl.handle.net/11336/85989 |
| Access Level: | acceso abierto |
| Palavra-chave: | CUT AND BRANCH EQUITABLE GRAPH COLORING INTEGER PROGRAMMING https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Resumo: | In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows the efficacy of these inequalities used in a cutting-plane algorithm. |
|---|