Solving a multicoloring problem with overlaps using integer programming

Autores
Méndez Díaz, Isabel; Zabala, Paula Lorena
Año de publicación
2010
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil: Méndez Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Zabala, Paula Lorena. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
Graph Multicoloring
Integer Programming
Branch And Cut
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/16547
Acceder
id CONICETDig_5e2090c8731aa235e41a708acde569e6
oai_identifier_str oai:ri.conicet.gov.ar:11336/16547
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Solving a multicoloring problem with overlaps using integer programmingMéndez Díaz, IsabelZabala, Paula LorenaGraph MulticoloringInteger ProgrammingBranch And Cuthttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1This 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.Fil: Méndez Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Zabala, Paula Lorena. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaElsevier Science2010-02info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/16547Méndez Díaz, Isabel; Zabala, Paula Lorena; Solving a multicoloring problem with overlaps using integer programming; Elsevier Science; Discrete Applied Mathematics; 158; 4; 2-2010; 349-3540166-218Xenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2009.05.007info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0166218X09002650info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-11-05T09:38:27Zoai:ri.conicet.gov.ar:11336/16547instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-11-05 09:38:27.387CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Solving a multicoloring problem with overlaps using integer programming
title Solving a multicoloring problem with overlaps using integer programming
spellingShingle Solving a multicoloring problem with overlaps using integer programming
Méndez Díaz, Isabel
Graph Multicoloring
Integer Programming
Branch And Cut
title_short Solving a multicoloring problem with overlaps using integer programming
title_full Solving a multicoloring problem with overlaps using integer programming
title_fullStr Solving a multicoloring problem with overlaps using integer programming
title_full_unstemmed Solving a multicoloring problem with overlaps using integer programming
title_sort Solving a multicoloring problem with overlaps using integer programming
dc.creator.none.fl_str_mv Méndez Díaz, Isabel
Zabala, Paula Lorena
author Méndez Díaz, Isabel
author_facet Méndez Díaz, Isabel
Zabala, Paula Lorena
author_role author
author2 Zabala, Paula Lorena
author2_role author
dc.subject.none.fl_str_mv Graph Multicoloring
Integer Programming
Branch And Cut
topic Graph Multicoloring
Integer Programming
Branch And Cut
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Méndez Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Zabala, Paula Lorena. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description 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.
publishDate 2010
dc.date.none.fl_str_mv 2010-02
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/16547
Méndez Díaz, Isabel; Zabala, Paula Lorena; Solving a multicoloring problem with overlaps using integer programming; Elsevier Science; Discrete Applied Mathematics; 158; 4; 2-2010; 349-354
0166-218X
url http://hdl.handle.net/11336/16547
identifier_str_mv Méndez Díaz, Isabel; Zabala, Paula Lorena; Solving a multicoloring problem with overlaps using integer programming; Elsevier Science; Discrete Applied Mathematics; 158; 4; 2-2010; 349-354
0166-218X
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2009.05.007
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0166218X09002650
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1847976881135026176
score 13.087074

Publicaciones similares