An exact algorithm for the edge coloring by total labeling problem

Autores
Borghini, Fabrizio; Méndez-Díaz, Isabel; Zabala, Paula Lorena
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This paper addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels of its two endpoints, determine a proper edge coloring of the graph. We propose two integer programming formulations and derive valid inequalities which are added as cutting planes on a Branch-and-Cut framework. In order to improve the efficiency of the algorithm, we also develop initial and primal heuristics. The algorithm is tested on random instances and the computational results show that it is very effective in comparison with CPLEX. It is displayed that it reduces both the CPU time (for solved instances) and the final percentage gap (for unsolved instances), and that it is capable of solving instances that are out of the reach of CPLEX.
Fil: Borghini, Fabrizio. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina
Fil: Méndez-Díaz, Isabel. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires; Argentina
Fil: Zabala, Paula Lorena. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Materia
BRANCH-AND-CUT
EDGE COLORING
GRAPH COLORING
TOTAL LABELING
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/97121
Acceder
id CONICETDig_d8a23bc3f22f72d280aa0ce7133abafa
oai_identifier_str oai:ri.conicet.gov.ar:11336/97121
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An exact algorithm for the edge coloring by total labeling problemBorghini, FabrizioMéndez-Díaz, IsabelZabala, Paula LorenaBRANCH-AND-CUTEDGE COLORINGGRAPH COLORINGTOTAL LABELINGhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1This paper addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels of its two endpoints, determine a proper edge coloring of the graph. We propose two integer programming formulations and derive valid inequalities which are added as cutting planes on a Branch-and-Cut framework. In order to improve the efficiency of the algorithm, we also develop initial and primal heuristics. The algorithm is tested on random instances and the computational results show that it is very effective in comparison with CPLEX. It is displayed that it reduces both the CPU time (for solved instances) and the final percentage gap (for unsolved instances), and that it is capable of solving instances that are out of the reach of CPLEX.Fil: Borghini, Fabrizio. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; ArgentinaFil: Méndez-Díaz, Isabel. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires; ArgentinaFil: Zabala, Paula Lorena. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; ArgentinaSpringer2018-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/97121Borghini, Fabrizio; Méndez-Díaz, Isabel; Zabala, Paula Lorena; An exact algorithm for the edge coloring by total labeling problem; Springer; Annals Of Operations Research; 7-20180254-5330CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1007/s10479-018-2977-xinfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs10479-018-2977-x#Abs1info: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-09-03T09:49:28Zoai:ri.conicet.gov.ar:11336/97121instacron: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-09-03 09:49:28.74CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An exact algorithm for the edge coloring by total labeling problem
title An exact algorithm for the edge coloring by total labeling problem
spellingShingle An exact algorithm for the edge coloring by total labeling problem
Borghini, Fabrizio
BRANCH-AND-CUT
EDGE COLORING
GRAPH COLORING
TOTAL LABELING
title_short An exact algorithm for the edge coloring by total labeling problem
title_full An exact algorithm for the edge coloring by total labeling problem
title_fullStr An exact algorithm for the edge coloring by total labeling problem
title_full_unstemmed An exact algorithm for the edge coloring by total labeling problem
title_sort An exact algorithm for the edge coloring by total labeling problem
dc.creator.none.fl_str_mv Borghini, Fabrizio
Méndez-Díaz, Isabel
Zabala, Paula Lorena
author Borghini, Fabrizio
author_facet Borghini, Fabrizio
Méndez-Díaz, Isabel
Zabala, Paula Lorena
author_role author
author2 Méndez-Díaz, Isabel
Zabala, Paula Lorena
author2_role author
author
dc.subject.none.fl_str_mv BRANCH-AND-CUT
EDGE COLORING
GRAPH COLORING
TOTAL LABELING
topic BRANCH-AND-CUT
EDGE COLORING
GRAPH COLORING
TOTAL LABELING
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 addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels of its two endpoints, determine a proper edge coloring of the graph. We propose two integer programming formulations and derive valid inequalities which are added as cutting planes on a Branch-and-Cut framework. In order to improve the efficiency of the algorithm, we also develop initial and primal heuristics. The algorithm is tested on random instances and the computational results show that it is very effective in comparison with CPLEX. It is displayed that it reduces both the CPU time (for solved instances) and the final percentage gap (for unsolved instances), and that it is capable of solving instances that are out of the reach of CPLEX.
Fil: Borghini, Fabrizio. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina
Fil: Méndez-Díaz, Isabel. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires; Argentina
Fil: Zabala, Paula Lorena. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
description This paper addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels of its two endpoints, determine a proper edge coloring of the graph. We propose two integer programming formulations and derive valid inequalities which are added as cutting planes on a Branch-and-Cut framework. In order to improve the efficiency of the algorithm, we also develop initial and primal heuristics. The algorithm is tested on random instances and the computational results show that it is very effective in comparison with CPLEX. It is displayed that it reduces both the CPU time (for solved instances) and the final percentage gap (for unsolved instances), and that it is capable of solving instances that are out of the reach of CPLEX.
publishDate 2018
dc.date.none.fl_str_mv 2018-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/97121
Borghini, Fabrizio; Méndez-Díaz, Isabel; Zabala, Paula Lorena; An exact algorithm for the edge coloring by total labeling problem; Springer; Annals Of Operations Research; 7-2018
0254-5330
CONICET Digital
CONICET
url http://hdl.handle.net/11336/97121
identifier_str_mv Borghini, Fabrizio; Méndez-Díaz, Isabel; Zabala, Paula Lorena; An exact algorithm for the edge coloring by total labeling problem; Springer; Annals Of Operations Research; 7-2018
0254-5330
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.1007/s10479-018-2977-x
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs10479-018-2977-x#Abs1
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 Springer
publisher.none.fl_str_mv Springer
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_ 1842268974873575424
score 13.13397

Publicaciones similares