A branch-and-price algorithm for the (k,c)-coloring problem

Autores
Malaguti, Enrico; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Zabala, Paula Lorena
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this article, we study the (k,c)-coloring problem, a generalization of the vertex coloring problem where we have to assign k colors to each vertex of an undirected graph, and two adjacent vertices can share at most c colors. We propose a new formulation for the (k,c)-coloring problem and develop a Branch-and-Price algorithm. We tested the algorithm on instances having from 20 to 80 vertices and different combinations for k and c, and compare it with a recent algorithm proposed in the literature. Computational results show that the overall approach is effective and has very good performance on instances where the previous algorithm fails.
Fil: Malaguti, Enrico. Universidad de Bologna; Italia
Fil: Méndez-Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Miranda Bront, Juan Jose. 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
Branch-And-Price
Column Generation
Computational Experiments
Frequency Assignment
Heuristics
Multicoloring
Vertex Coloring
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/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/59603
Acceder
id CONICETDig_46aa8464c52dcb02536b0c95194c5eca
oai_identifier_str oai:ri.conicet.gov.ar:11336/59603
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A branch-and-price algorithm for the (k,c)-coloring problemMalaguti, EnricoMéndez-Díaz, IsabelMiranda Bront, Juan JoseZabala, Paula LorenaBranch-And-PriceColumn GenerationComputational ExperimentsFrequency AssignmentHeuristicsMulticoloringVertex Coloringhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In this article, we study the (k,c)-coloring problem, a generalization of the vertex coloring problem where we have to assign k colors to each vertex of an undirected graph, and two adjacent vertices can share at most c colors. We propose a new formulation for the (k,c)-coloring problem and develop a Branch-and-Price algorithm. We tested the algorithm on instances having from 20 to 80 vertices and different combinations for k and c, and compare it with a recent algorithm proposed in the literature. Computational results show that the overall approach is effective and has very good performance on instances where the previous algorithm fails.Fil: Malaguti, Enrico. Universidad de Bologna; ItaliaFil: Méndez-Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Miranda Bront, Juan Jose. 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; ArgentinaJohn Wiley & Sons Inc2015-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/59603Malaguti, Enrico; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Zabala, Paula Lorena; A branch-and-price algorithm for the (k,c)-coloring problem; John Wiley & Sons Inc; Networks; 65; 4; 7-2015; 353-3660028-3045CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1002/net.21579info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21579info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-11-12T09:54:03Zoai:ri.conicet.gov.ar:11336/59603instacron: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-12 09:54:04.244CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A branch-and-price algorithm for the (k,c)-coloring problem
title A branch-and-price algorithm for the (k,c)-coloring problem
spellingShingle A branch-and-price algorithm for the (k,c)-coloring problem
Malaguti, Enrico
Branch-And-Price
Column Generation
Computational Experiments
Frequency Assignment
Heuristics
Multicoloring
Vertex Coloring
title_short A branch-and-price algorithm for the (k,c)-coloring problem
title_full A branch-and-price algorithm for the (k,c)-coloring problem
title_fullStr A branch-and-price algorithm for the (k,c)-coloring problem
title_full_unstemmed A branch-and-price algorithm for the (k,c)-coloring problem
title_sort A branch-and-price algorithm for the (k,c)-coloring problem
dc.creator.none.fl_str_mv Malaguti, Enrico
Méndez-Díaz, Isabel
Miranda Bront, Juan Jose
Zabala, Paula Lorena
author Malaguti, Enrico
author_facet Malaguti, Enrico
Méndez-Díaz, Isabel
Miranda Bront, Juan Jose
Zabala, Paula Lorena
author_role author
author2 Méndez-Díaz, Isabel
Miranda Bront, Juan Jose
Zabala, Paula Lorena
author2_role author
author
author
dc.subject.none.fl_str_mv Branch-And-Price
Column Generation
Computational Experiments
Frequency Assignment
Heuristics
Multicoloring
Vertex Coloring
topic Branch-And-Price
Column Generation
Computational Experiments
Frequency Assignment
Heuristics
Multicoloring
Vertex Coloring
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this article, we study the (k,c)-coloring problem, a generalization of the vertex coloring problem where we have to assign k colors to each vertex of an undirected graph, and two adjacent vertices can share at most c colors. We propose a new formulation for the (k,c)-coloring problem and develop a Branch-and-Price algorithm. We tested the algorithm on instances having from 20 to 80 vertices and different combinations for k and c, and compare it with a recent algorithm proposed in the literature. Computational results show that the overall approach is effective and has very good performance on instances where the previous algorithm fails.
Fil: Malaguti, Enrico. Universidad de Bologna; Italia
Fil: Méndez-Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Miranda Bront, Juan Jose. 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 In this article, we study the (k,c)-coloring problem, a generalization of the vertex coloring problem where we have to assign k colors to each vertex of an undirected graph, and two adjacent vertices can share at most c colors. We propose a new formulation for the (k,c)-coloring problem and develop a Branch-and-Price algorithm. We tested the algorithm on instances having from 20 to 80 vertices and different combinations for k and c, and compare it with a recent algorithm proposed in the literature. Computational results show that the overall approach is effective and has very good performance on instances where the previous algorithm fails.
publishDate 2015
dc.date.none.fl_str_mv 2015-07
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/59603
Malaguti, Enrico; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Zabala, Paula Lorena; A branch-and-price algorithm for the (k,c)-coloring problem; John Wiley & Sons Inc; Networks; 65; 4; 7-2015; 353-366
0028-3045
CONICET Digital
CONICET
url http://hdl.handle.net/11336/59603
identifier_str_mv Malaguti, Enrico; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Zabala, Paula Lorena; A branch-and-price algorithm for the (k,c)-coloring problem; John Wiley & Sons Inc; Networks; 65; 4; 7-2015; 353-366
0028-3045
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1002/net.21579
info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21579
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv John Wiley & Sons Inc
publisher.none.fl_str_mv John Wiley & Sons Inc
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_ 1848598243313713152
score 12.976206

Publicaciones similares