{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:08:21Z","timestamp":1778562501517,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T00:00:00Z","timestamp":1532476800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010253","name":"UBACyT","doi-asserted-by":"crossref","award":["2014-2017 20020130100467BA"],"award-info":[{"award-number":["2014-2017 20020130100467BA"]}],"id":[{"id":"10.13039\/501100010253","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10479-018-2977-x","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T23:19:06Z","timestamp":1532474346000},"page":"11-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An exact algorithm for the edge coloring by total labeling problem"],"prefix":"10.1007","volume":"286","author":[{"given":"Fabrizio","family":"Borghini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"M\u00e9ndez-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1341-4152","authenticated-orcid":false,"given":"Paula","family":"Zabala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,25]]},"reference":[{"issue":"1","key":"2977_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"K Aardal","year":"2007","unstructured":"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\u2013129.","journal-title":"Annals of Operations Research"},{"issue":"11","key":"2977_CR2","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1016\/j.disc.2005.11.075","volume":"307","author":"M Ba\u010da","year":"2007","unstructured":"Ba\u010da, M., Miller, M., & Ryan, J. (2007). On irregular total labellings. Discrete Mathematics, 307(11), 1378\u20131388.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"2977_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.disc.2008.09.013","volume":"310","author":"S Brandt","year":"2010","unstructured":"Brandt, S., Budajov, K., Rautenbach, D., & Stiebitz, M. (2010). Edge colouring by total labellings. Discrete Mathematics, 310(2), 199\u2013205.","journal-title":"Discrete Mathematics"},{"issue":"4","key":"2977_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Brelaz","year":"1979","unstructured":"Brelaz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22(4), 251\u2013256.","journal-title":"Communications of the ACM"},{"issue":"1","key":"2977_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-010-0828-5","volume":"194","author":"E Burke","year":"2012","unstructured":"Burke, E., Mare\u010dek, K., Parkes, A., & Rudov\u00e1, H. (2012). A branch-and-cut procedure for the Udine Course Timetabling problem. Annals of Operations Research, 194(1), 71\u201387.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2977_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1021315911306","volume":"116","author":"P Coll","year":"2002","unstructured":"Coll, P., Marenco, J., M\u00e9ndez D\u00edaz, I., & Zabala, P. (2002). Facets of the graph coloring polytope. Annals of Operations Research, 116(1), 79\u201390.","journal-title":"Annals of Operations Research"},{"key":"2977_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.dam.2016.09.018","volume":"217","author":"D Cornaz","year":"2017","unstructured":"Cornaz, D., Furini, F., & Malaguti, E. (2017). Solving vertex coloring problems as maximum weight stable set problems. Discrete Applied Mathematics, 217, 151\u2013162.","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"2977_CR8","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., & Reinelt, G. (1984). A cutting plane algorithm for the linear ordering problem. Operations research, 32(6), 1195\u20131220.","journal-title":"Operations research"},{"issue":"1","key":"2977_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., & Reinelt, G. (1985). Facets of the linear ordering polytope. Mathematical Programming, 33(1), 43\u201360.","journal-title":"Mathematical Programming"},{"key":"2977_CR10","unstructured":"IBM. CPLEX Optimizer for z\/OS. \nhttp:\/\/pic.dhe.ibm.com\/infocenter\/cplexzos\/v12r6\/index.jsp\n\n."},{"key":"2977_CR11","volume-title":"Graph coloring problems","author":"T Jensen","year":"1995","unstructured":"Jensen, T., & Toth, P. (1995). Graph coloring problems. Hoboken: Wiley."},{"issue":"13","key":"2977_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ipl.2013.03.017","volume":"113","author":"R Khennoufa","year":"2013","unstructured":"Khennoufa, R., Seba, H., & Kheddouci, H. (2013). Edge coloring total k-labelling of generalized petersen graphs. Information Processing Letters, 113(13), 489\u2013494.","journal-title":"Information Processing Letters"},{"issue":"4","key":"2977_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0167-6377(93)90043-G","volume":"13","author":"J Lee","year":"1993","unstructured":"Lee, J., & Leung, J. (1993). A comparison of two edge-coloring formulations. Operations Research Letters, 13(4), 215\u2013223.","journal-title":"Operations Research Letters"},{"issue":"4","key":"2977_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/net.21579","volume":"65","author":"E Malaguti","year":"2015","unstructured":"Malaguti, E., M\u00e9ndez-D\u00edaz, I., Miranda-Bront, J., & Zabala, P. (2015). A branch-and-price algorithm for the (k; c)-coloring problem. Networks, 65(4), 353\u2013366.","journal-title":"Networks"},{"issue":"3","key":"2977_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","volume":"41","author":"J Misra","year":"1992","unstructured":"Misra, J., & Gries, D. (1992). A constructive proof of vizing\u2019s theorem. Information Processing Letters, 41(3), 131\u2013133.","journal-title":"Information Processing Letters"},{"key":"2977_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.endm.2013.05.086","volume":"41","author":"H Seba","year":"2013","unstructured":"Seba, H., & Khennoufa, R. (2013). Edge coloring by total labellings of 4-regular circulant graphs. Electronic Notes in Discrete Mathematics, 41, 141\u2013148.","journal-title":"Electronic Notes in Discrete Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2977-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2977-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2977-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T13:19:50Z","timestamp":1580995190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2977-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,25]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2977"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2977-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,25]]},"assertion":[{"value":"25 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}