(k, c) − coloring via Column Generation

dc.creatorMalaguti, Enrico
dc.creatorMéndez Díaz, Isabel
dc.creatorMiranda Bront, Juan Jose
dc.creatorZabala, Paula Lorena
dc.date.accessioned2017-05-02T20:17:03Z
dc.date.accessioned2018-11-06T12:40:57Z
dc.date.available2017-05-02T20:17:03Z
dc.date.available2018-11-06T12:40:57Z
dc.date.created2017-05-02T20:17:03Z
dc.date.issued2013-06
dc.identifierMalaguti, Enrico; Méndez Díaz, Isabel; Miranda Bront, Juan Jose; Zabala, Paula Lorena; (k, c) − coloring via Column Generation; Elsevier Science; Electronic Notes In Discrete Mathematics; 41; 6-2013; 447-454
dc.identifier1571-0653
dc.identifierhttp://hdl.handle.net/11336/15897
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1869049
dc.description.abstractIn this paper we study the (k, c)-coloring problem, a generalization of the well known Vertex Coloring Problem (VCP). We propose a new formulation and compare it computationally with another formulation from the literature. We also develop a diving heuristic that provides with good quality results at a reasonable computational effort.
dc.languageeng
dc.publisherElsevier Science
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://dx.doi.org/10.1016/j.endm.2013.05.124
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S1571065313001273?via%3Dihub
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subject(k, c)-coloring
dc.subjectcolumn generation
dc.subjectdiving heuristic
dc.title(k, c) − coloring via Column Generation
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución