{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T12:56:11Z","timestamp":1760100971374,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T00:00:00Z","timestamp":1489622400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00500-017-2540-8","type":"journal-article","created":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T04:40:36Z","timestamp":1489639236000},"page":"2765-2776","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The rainbow spanning forest problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Francesco","family":"Carrabs","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6243-4512","authenticated-orcid":false,"given":"Carmine","family":"Cerrone","sequence":"additional","affiliation":[]},{"given":"Raffaele","family":"Cerulli","sequence":"additional","affiliation":[]},{"given":"Selene","family":"Silvestri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"issue":"3","key":"2540_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/jgt.20204","volume":"54","author":"S Akbari","year":"2007","unstructured":"Akbari S, Alipour A (2007) Multicolored trees in complete graphs. J Gr Theory 54(3):221\u2013232","journal-title":"J Gr Theory"},{"key":"2540_CR2","first-page":"189","volume":"97","author":"E Andrews","year":"2016","unstructured":"Andrews E, Lumduanhom C, Laforge E, Zhang P (2016) On proper-path colorings in graphs. J Comb Math Comb Comput 97:189\u2013207","journal-title":"J Comb Math Comb Comput"},{"key":"2540_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(00)00159-X","volume":"240","author":"RA Brualdi","year":"2001","unstructured":"Brualdi RA, Hollingsworth S (2001) Multicolored forests in complete bipartite graphs. Discret Math 240:239\u2013245","journal-title":"Discret Math"},{"key":"2540_CR4","unstructured":"Carr RD, Doddi S, Konjedov G, Marathe M (2000) On the red-blue set cover problem. In: 11th ACN-SIAM symposium on discrete algorithms, pp 345\u2013353"},{"key":"2540_CR5","doi-asserted-by":"crossref","unstructured":"Carrabs F, Cerrone C, Cerulli R (2014) A tabu search approach for the circle packing problem. In: 2014 17th International conference on network-based information systems. pp 165\u2013171. IEEE","DOI":"10.1109\/NBiS.2014.28"},{"key":"2540_CR6","unstructured":"Carrabs F, Cerrone C, Cerulli R, Silvestri S (March 2016) On the complexity of rainbow spanning forest problem. Technical Report 14922, Department od Mathematics, University of Salerno"},{"key":"2540_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.sbspro.2013.12.821","volume":"108","author":"F Carrabs","year":"2014","unstructured":"Carrabs F, Cerulli R, Dell\u2019Olmo P (2014) A mathematical programming approach for the maximum labeled clique problem. Proced Soc Behav Sci 108:69\u201378","journal-title":"Proced Soc Behav Sci"},{"key":"2540_CR8","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1016\/j.cor.2008.05.012","volume":"36","author":"F Carrabs","year":"2009","unstructured":"Carrabs F, Cerulli R, Gentili M (2009) The labeled maximum matching problem. Comput Oper Res 36:1859\u20131871","journal-title":"Comput Oper Res"},{"key":"2540_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ejc.2016.04.003","volume":"57","author":"JM Carraher","year":"2016","unstructured":"Carraher JM, Hartke SG, Horn P (2016) Edge-disjoint rainbow spanning trees in complete graphs. Eur J Comb 57:71\u201384","journal-title":"Eur J Comb"},{"key":"2540_CR10","doi-asserted-by":"crossref","unstructured":"Cerrone C, Cerull R, Golden B (2017) Carousel greedy: a generalized greedy algorithm with applications in optimization. Comput Oper Res (submitted)","DOI":"10.1016\/j.cor.2017.03.016"},{"issue":"2","key":"2540_CR11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s11590-015-0852-0","volume":"10","author":"C Cerrone","year":"2016","unstructured":"Cerrone C, Cerulli R, Gaudioso M (2016) Omega one multi ethnic genetic approach. Optim Lett 10(2):309\u2013324","journal-title":"Optim Lett"},{"issue":"2","key":"2540_CR12","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.ejor.2015.05.070","volume":"247","author":"C Cerrone","year":"2015","unstructured":"Cerrone C, Cerulli R, Gentili M (2015) Vehicle-id sensor location for route flow recognition: models and algorithms. Eur J Oper Res 247(2):618\u2013629","journal-title":"Eur J Oper Res"},{"key":"2540_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.endm.2006.06.080","volume":"25","author":"R Cerulli","year":"2006","unstructured":"Cerulli R, Dell\u2019Olmo P, Gentili M, Raiconi A (2006) Heuristic approaches for the minimum labelling hamiltonian cycle problem. Electron Notes Discret Math 25:131\u2013138","journal-title":"Electron Notes Discret Math"},{"key":"2540_CR14","doi-asserted-by":"crossref","unstructured":"Cerulli R, Fink A, Gentili M, Vo\u00df S (2005) Metaheuristics comparison for the minimum labelling spanning tree problem. In: The next wave in computing, optimization, and decision technologies. Springer, pp 93\u2013106","DOI":"10.1007\/0-387-23529-9_7"},{"key":"2540_CR15","doi-asserted-by":"crossref","unstructured":"Chang RS, Leu SJ (1997) The minimum labeling spanning trees. Inf Process Lett 63:277\u2013282","DOI":"10.1016\/S0020-0190(97)00127-0"},{"key":"2540_CR16","doi-asserted-by":"crossref","unstructured":"Chen Y, Cornick N, Hall AO, Shajpal R, Silberholz J, Yahav I, Golden B (2008) Comparison of heuristics for solving the gmlst problem. In: Telecommunications modeling, policy, and technology. Springer, pp 191\u2013217","DOI":"10.1007\/978-0-387-77780-1_9"},{"key":"2540_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10479-008-0507-y","volume":"172","author":"S Consoli","year":"2009","unstructured":"Consoli S, Darby-Dowman K, Mladenovi\u0107 N, Moreno-P\u00e9rez JA (2009) Variable neighbourhood search for the minimum labelling steiner tree problem. Ann Oper Res 172:71\u201396","journal-title":"Ann Oper Res"},{"key":"2540_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s11047-009-9137-9","volume":"9","author":"S Consoli","year":"2010","unstructured":"Consoli S, Moreno-P\u00e9rez JA, Darby-Dowman K, Mladenovi\u0107 N (2010) Discrete particle swarm optimization for the minimum labelling steiner tree problem. Nat Comput 9:29\u201346","journal-title":"Nat Comput"},{"key":"2540_CR19","first-page":"393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig GB, Fulkerson DR, Johnson SM (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2:393\u2013410","journal-title":"J Oper Res Soc Am"},{"key":"2540_CR20","unstructured":"Fischetti M, Salazar\u00a0Gonz\u00e1lez JJ, Toth P (1995) Experiments with a multi-commodity formulation for the symmetric capacitated vehicle routing problem. In: Proceedings of the 3rd meeting of the euro working group on transportation. pp 169\u2013173"},{"key":"2540_CR21","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1016\/j.cor.2011.01.011","volume":"38","author":"N Jozefowiez","year":"2011","unstructured":"Jozefowiez N, Laporte G, Semet F (2011) A branch-and-cut algorithm for the minimum labeling hamiltonian cycle problem and two variants. Comput Oper Res 38:1534\u20131542","journal-title":"Comput Oper Res"},{"issue":"2","key":"2540_CR22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S Krumke","year":"1998","unstructured":"Krumke S, Wirth H (1998) On the minimum label spanning tree problem. Inf Process Lett 66(2):81\u201385","journal-title":"Inf Process Lett"},{"key":"2540_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2007.04.033","volume":"385","author":"X Li","year":"2007","unstructured":"Li X, Zhang XY (2007) On the minimum monochromatic or multicolored subgraph partition problems. Theor Comput Sci 385:1\u201310","journal-title":"Theor Comput Sci"},{"key":"2540_CR24","doi-asserted-by":"crossref","unstructured":"Silvestri S, Laporte G, Cerulli R (2016) The rainbow cycle cover problem. Networks 68(4):260\u2013270","DOI":"10.1002\/net.21700"},{"key":"2540_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00373-006-0662-3","volume":"22","author":"K Suzuki","year":"2006","unstructured":"Suzuki K (2006) A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph. Gr Comb 22:261\u2013269","journal-title":"Gr Comb"},{"issue":"1","key":"2540_CR26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1051\/ro\/2013046","volume":"48","author":"M Szachniuk","year":"2014","unstructured":"Szachniuk M, De Cola M, Felici G, B\u0142a\u017cewicz J (2014) The orderly colored longest path problem-a survey of applications and new algorithms. RAIRO Oper Res 48(1):25\u201351","journal-title":"RAIRO Oper Res"},{"key":"2540_CR27","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.dam.2014.04.010","volume":"182","author":"M Szachniuk","year":"2015","unstructured":"Szachniuk M, De Cola M, Felici G, De Werra D, B\u0142a\u017cewicz J (2015) Optimal pathway reconstruction on 3d nmr maps. Discret Appl Math 182:134\u2013149","journal-title":"Discret Appl Math"},{"key":"2540_CR28","doi-asserted-by":"crossref","unstructured":"Xiong Y, Golden B, Wasil E (2007) The colorful traveling salesman problem. In: Extending the horizons: advances in computing, optimization, and decision technologies. Springer, pp 115\u2013123","DOI":"10.1007\/978-0-387-48793-9_8"},{"key":"2540_CR29","doi-asserted-by":"crossref","unstructured":"Xiongm Y, Golden B, Wasil E, Chen S (2008) The label-constrained minimum spanning tree problem. In: Telecommunications modeling, policy, and technology, Springer, pp 39\u201358","DOI":"10.1007\/978-0-387-77780-1_3"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2540-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2540-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2540-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T16:36:06Z","timestamp":1568910966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2540-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,16]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["2540"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2540-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2017,3,16]]}}}