Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Vertices are ordered according to the standard order on the natural numbers.
References
Aardal, K., van Hoesel, S., Koster, A., Mannino, C., & Sassano, A. (2007). Models and solution techniques for frequency assignment problems. Annals of Operations Research, 153(1), 79–129.
Bača, M., Miller, M., & Ryan, J. (2007). On irregular total labellings. Discrete Mathematics, 307(11), 1378–1388.
Brandt, S., Budajov, K., Rautenbach, D., & Stiebitz, M. (2010). Edge colouring by total labellings. Discrete Mathematics, 310(2), 199–205.
Brelaz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22(4), 251–256.
Burke, E., Mareček, K., Parkes, A., & Rudová, H. (2012). A branch-and-cut procedure for the Udine Course Timetabling problem. Annals of Operations Research, 194(1), 71–87.
Coll, P., Marenco, J., Méndez Díaz, I., & Zabala, P. (2002). Facets of the graph coloring polytope. Annals of Operations Research, 116(1), 79–90.
Cornaz, D., Furini, F., & Malaguti, E. (2017). Solving vertex coloring problems as maximum weight stable set problems. Discrete Applied Mathematics, 217, 151–162.
Grötschel, M., Jünger, M., & Reinelt, G. (1984). A cutting plane algorithm for the linear ordering problem. Operations research, 32(6), 1195–1220.
Grötschel, M., Jünger, M., & Reinelt, G. (1985). Facets of the linear ordering polytope. Mathematical Programming, 33(1), 43–60.
IBM. CPLEX Optimizer for z/OS. http://pic.dhe.ibm.com/infocenter/cplexzos/v12r6/index.jsp.
Jensen, T., & Toth, P. (1995). Graph coloring problems. Hoboken: Wiley.
Khennoufa, R., Seba, H., & Kheddouci, H. (2013). Edge coloring total k-labelling of generalized petersen graphs. Information Processing Letters, 113(13), 489–494.
Lee, J., & Leung, J. (1993). A comparison of two edge-coloring formulations. Operations Research Letters, 13(4), 215–223.
Malaguti, E., Méndez-Díaz, I., Miranda-Bront, J., & Zabala, P. (2015). A branch-and-price algorithm for the (k; c)-coloring problem. Networks, 65(4), 353–366.
Misra, J., & Gries, D. (1992). A constructive proof of vizing’s theorem. Information Processing Letters, 41(3), 131–133.
Seba, H., & Khennoufa, R. (2013). Edge coloring by total labellings of 4-regular circulant graphs. Electronic Notes in Discrete Mathematics, 41, 141–148.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by UBACYT Grant 2014-2017 20020130100467BA.
Rights and permissions
About this article
Cite this article
Borghini, F., Méndez-Díaz, I. & Zabala, P. An exact algorithm for the edge coloring by total labeling problem. Ann Oper Res 286, 11–31 (2020). https://doi.org/10.1007/s10479-018-2977-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-018-2977-x