An exact algorithm for the edge coloring by total labeling problem
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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | INPR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_02545330_v_n_p_Borghini |
| Aporte de: |
| Sumario: | 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. © 2018, Springer Science+Business Media, LLC, part of Springer Nature. |
|---|