Artículo
An exact algorithm for the edge coloring by total labeling problem
Fecha de publicación:
07/2018
Editorial:
Springer
Revista:
Annals Of Operations Research
ISSN:
0254-5330
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
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.
Palabras clave:
BRANCH-AND-CUT
,
EDGE COLORING
,
GRAPH COLORING
,
TOTAL LABELING
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(ICC)
Articulos de INSTITUTO DE INVESTIGACION EN CIENCIAS DE LA COMPUTACION
Articulos de INSTITUTO DE INVESTIGACION EN CIENCIAS DE LA COMPUTACION
Citación
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
Compartir
Altmétricas