| dc.creator | Méndez-Díaz, Isabel | |
| dc.creator | Nasini, Graciela Leonor | |
| dc.creator | Severin, Daniel Esteban | |
| dc.date.accessioned | 2019-10-15T21:29:32Z | |
| dc.date.accessioned | 2022-10-15T10:37:01Z | |
| dc.date.available | 2019-10-15T21:29:32Z | |
| dc.date.available | 2022-10-15T10:37:01Z | |
| dc.date.created | 2019-10-15T21:29:32Z | |
| dc.date.issued | 2014-02 | |
| dc.identifier | Méndez-Díaz, Isabel; Nasini, Graciela Leonor; Severin, Daniel Esteban; A polyhedral approach for the equitable coloring problem; Elsevier Science; Discrete Applied Mathematics; 164; Part 2; 2-2014; 413-426 | |
| dc.identifier | 0166-218X | |
| dc.identifier | http://hdl.handle.net/11336/85989 | |
| dc.identifier | CONICET Digital | |
| dc.identifier | CONICET | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4376361 | |
| dc.description.abstract | 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. | |
| dc.language | eng | |
| dc.publisher | Elsevier Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.dam.2012.11.018 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0166218X12004477 | |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | CUT AND BRANCH | |
| dc.subject | EQUITABLE GRAPH COLORING | |
| dc.subject | INTEGER PROGRAMMING | |
| dc.title | A polyhedral approach for the equitable coloring problem | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
