{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:13:25Z","timestamp":1764656005397,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["207334\/2015-3"],"award-info":[{"award-number":["207334\/2015-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s13675-018-0099-5","type":"journal-article","created":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T10:59:44Z","timestamp":1528109984000},"page":"47-77","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["A polyhedral approach to the generalized minimum labeling spanning tree problem"],"prefix":"10.1016","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6198-7369","authenticated-orcid":false,"given":"ThiagoGouveiada","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serigne","family":"Gueye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LuizSatoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc\u00eddiodosAnjosFormiga","family":"Cabral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1007\/s13675-018-0099-5_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(02)00241-9","article-title":"Local search for the minimum label spanning tree problem with bounded color classes","volume":"31","author":"Br\u00fcggemann","year":"2003","journal-title":"Oper Res Lett"},{"issue":"11","key":"10.1007\/s13675-018-0099-5_CR2","doi-asserted-by":"crossref","first-page":"3082","DOI":"10.1016\/j.cor.2009.02.003","article-title":"A mixed integer linear formulation for the minimum label spanning tree problem","volume":"36","author":"Captivo","year":"2009","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-018-0099-5_CR3","series-title":"The next wave in computing, optimization, and decision technologies. Operations research\/computer science interfaces series","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/0-387-23529-9_7","article-title":"Metaheuristics comparison for the minimum labelling spanning tree problem","author":"Cerulli","year":"2005"},{"issue":"5","key":"10.1007\/s13675-018-0099-5_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","article-title":"The minimum labeling spanning trees","volume":"63","author":"Chang","year":"1997","journal-title":"Inf Process Lett"},{"key":"10.1007\/s13675-018-0099-5_CR5","series-title":"Telecommunications modeling, policy, and technology","first-page":"191","article-title":"Comparison of heuristics for solving the gmlst problem","author":"Chen","year":"2008"},{"key":"10.1007\/s13675-018-0099-5_CR6","unstructured":"Chwatal AM, Raidl GR (2010) Solving the minimum label spanning tree problem by ant colony optimization. In: Arabnia HR, Hashemi RR, Solo AMG (eds) GEM. CSREA Press, Las Vegas, pp 91\u201397. ISBN: 1-60132-145-7"},{"key":"10.1007\/s13675-018-0099-5_CR7","article-title":"Solving the minimum label spanning tree problem by mathematical programming techniques","author":"Chwatal","year":"2011","journal-title":"Adv Oper Res"},{"key":"10.1007\/s13675-018-0099-5_CR8","doi-asserted-by":"crossref","unstructured":"Chwatal AM, Raidl GR, Oberlechner K (2009) Solving an extended minimum label spanning tree problem to compress fingerprint templates. J Math Model Algorithms 8(3):293\u2013334. previous technical report version at https:\/\/www.ac.tuwien.ac.at\/files\/pub\/chwatal-08a.pdf","DOI":"10.1007\/s10852-009-9109-1"},{"issue":"2","key":"10.1007\/s13675-018-0099-5_CR9","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.ejor.2008.03.014","article-title":"Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem","volume":"196","author":"Consoli","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"C","key":"10.1007\/s13675-018-0099-5_CR10","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.asoc.2014.12.020","article-title":"Solving the minimum labelling spanning tree problem by intelligent optimization","volume":"28","author":"Consoli","year":"2015","journal-title":"Appl Soft Comput"},{"key":"10.1007\/s13675-018-0099-5_CR11","series-title":"Handbook of combinatorial optimization","first-page":"1913","article-title":"Maximum flow problems and an np-complete variant on edge-labeled graphs","author":"Granata","year":"2013"},{"issue":"2","key":"10.1007\/s13675-018-0099-5_CR12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","article-title":"On the minimum label spanning tree problem","volume":"66","author":"Krumke","year":"1998","journal-title":"Inf Process Lett"},{"key":"10.1007\/s13675-018-0099-5_CR13","unstructured":"Van-Nes R (2002) Design of multimodal transport networks: a hierachical approach. PhD thesis. Delft University"},{"issue":"2","key":"10.1007\/s13675-018-0099-5_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0020-0190(02)00230-2","article-title":"A note on the minimum label spanning tree","volume":"84","author":"Wan","year":"2002","journal-title":"Inf Process Lett"},{"year":"2014","series-title":"Integer and combinatorial optimization","author":"Wolsey","key":"10.1007\/s13675-018-0099-5_CR15"},{"issue":"1","key":"10.1007\/s13675-018-0099-5_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TEVC.2004.840145","article-title":"A one-parameter genetic algorithm for the minimum labeling spanning tree problem","volume":"9","author":"Xiong","year":"2005","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"10.1007\/s13675-018-0099-5_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.orl.2004.03.004","article-title":"Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem","volume":"33","author":"Xiong","year":"2005","journal-title":"Oper Res Lett"},{"issue":"6","key":"10.1007\/s13675-018-0099-5_CR18","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/TEVC.2006.877147","article-title":"Improved heuristics for the minimum label spanning tree problem","volume":"10","author":"Xiong","year":"2006","journal-title":"IEEE Trans Evol Comput"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0099-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0099-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0099-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:54Z","timestamp":1761882414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["S2192440621001118"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0099-5","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A polyhedral approach to the generalized minimum labeling spanning tree problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-018-0099-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2019 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}