{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:31:10Z","timestamp":1759667470914,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T00:00:00Z","timestamp":1528416000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10589-018-0014-2","type":"journal-article","created":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T07:16:57Z","timestamp":1528442217000},"page":"525-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A two-level metaheuristic for the all colors shortest path problem"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2187-8624","authenticated-orcid":false,"given":"F.","family":"Carrabs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3277-6802","authenticated-orcid":false,"given":"R.","family":"Cerulli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1056-4390","authenticated-orcid":false,"given":"R.","family":"Pentangelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7188-8794","authenticated-orcid":false,"given":"A.","family":"Raiconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/LCOMM.2017.2772876","volume":"22","author":"H Akcan","year":"2018","unstructured":"Akcan, H., Evrendilek, C.: Complexity of energy efficient localization with the aid of a mobile beacon. IEEE Commun. Lett. 22(2), 392\u2013395 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-018-9370-4","author":"MB Ak\u00e7ay","year":"2018","unstructured":"Ak\u00e7ay, M.B., Akcan, H., Evrendilek, C.: All colors shortest path problem on trees. J. Heuristics (2018). \n                    https:\/\/doi.org\/10.1007\/s10732-018-9370-4","journal-title":"J. Heuristics"},{"issue":"11","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1016\/j.cor.2009.05.004","volume":"37","author":"B Bontoux","year":"2010","unstructured":"Bontoux, B., Artigues, C., Feillet, D.: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Comput. Oper. Res. 37(11), 1844\u20131852 (2010)","journal-title":"Comput. Oper. Res."},{"unstructured":"Can Bilge, Y., \u00c7agatay, D., Gen\u00e7, B., Sari, M., Akcan, H., Evrendilek, C.: All colors shortest path problem. \n                    arXiv:1507.06865","key":"14_CR4"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-67308-0_53","volume-title":"Springer Proceedings in Mathematics & Statistics","author":"Francesco Carrabs","year":"2017","unstructured":"Carrabs, F., Cerulli, R., Festa, P., Laureana, F.: On the forward shortest path tour problem. In: Sforza, A., Sterle, C. (eds.) Optimization and Decision Science: Methodologies and Applications, ODS 2017. Springer Proceedings in Mathematics & Statistics, vol. 217. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-67308-0_53"},{"key":"14_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1\u20134","key":"14_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0255(96)00084-9","volume":"102","author":"V Dimitrijevi\u0107","year":"1997","unstructured":"Dimitrijevi\u0107, V., \u0160ari\u0107, Z.: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Inf. Sci. 102(1\u20134), 105\u2013110 (1997)","journal-title":"Inf. Sci."},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","volume":"120","author":"M Dror","year":"2000","unstructured":"Dror, M., Haouari, M., Chaouachi, J.: Generalized spanning trees. Eur. J. Oper. Res. 120(3), 583\u2013592 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.10009","volume":"39","author":"C Feremans","year":"2002","unstructured":"Feremans, C., Labb\u00e9, M., Laporte, G.: A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1), 29\u201334 (2002)","journal-title":"Networks"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/net.10105","volume":"43","author":"C Feremans","year":"2004","unstructured":"Feremans, C., Labb\u00e9, M., Laporte, G.: The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks 43(2), 71\u201386 (2004)","journal-title":"Networks"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.ejor.2013.04.029","volume":"230","author":"P Festa","year":"2013","unstructured":"Festa, P., Guerriero, F., Lagan\u00e0, D., Musmanno, R.: Solving the shortest path tour problem. Eur. J. Oper. Res. 230(3), 464\u2013474 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230260206","volume":"26","author":"M Fischetti","year":"1995","unstructured":"Fischetti, M., Salazar Gonz\u00e1lez, J.J., Toth, P.: The symmetric generalized traveling salesman polytope. Networks 26(2), 113\u2013123 (1995)","journal-title":"Networks"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar Gonz\u00e1lez, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997)","journal-title":"Oper. Res."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1287\/ijoc.1040.0077","volume":"17","author":"B Golden","year":"2005","unstructured":"Golden, B., Raghavan, S., Stanojevi\u0107, D.: Heuristic search for the generalized minimum spanning tree problem. INFORMS J. Comput. 17(3), 290\u2013304 (2005)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1057\/palgrave.jors.2601821","volume":"56","author":"M Haouari","year":"2005","unstructured":"Haouari, M., Chaouachi, J., Dror, M.: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. J. Oper. Res. Soc. 56(4), 382\u2013389 (2005)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"14_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10732-007-9047-x","volume":"14","author":"B Hu","year":"2008","unstructured":"Hu, B., Leitner, M., Raidl, G.R.: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics 14(5), 473\u2013499 (2008)","journal-title":"J. Heuristics"},{"issue":"1\u20133","key":"14_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0166-218X(98)00090-0","volume":"90","author":"E Ihler","year":"1999","unstructured":"Ihler, E., Reich, G., Widmayer, P.: Class steiner trees and vlsi-design. Discrete Appl. Math. 90(1\u20133), 173\u2013194 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(87)90020-5","volume":"18","author":"G Laporte","year":"1987","unstructured":"Laporte, G., Mercure, H., Nobert, Y.: Generalized travelling salesman problem through n sets of nodes: the asymmetrical case. Discrete Appl. Math. 18(2), 185\u2013197 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"Y-S Myung","year":"1995","unstructured":"Myung, Y.-S., Lee, C.-H., Tcha, D.-W.: On the generalized minimum spanning tree problem. Networks 26(4), 231\u2013241 (1995)","journal-title":"Networks"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.ejor.2007.08.021","volume":"191","author":"T \u00d6ncan","year":"2008","unstructured":"\u00d6ncan, T., Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 191(2), 306\u2013319 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ejor.2004.07.058","volume":"170","author":"PC Pop","year":"2006","unstructured":"Pop, P.C., Kern, W., Still, G.: A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170(3), 900\u2013908 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"14_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"14_CR23","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. Eur. J. Oper. Res. 174(1), 38\u201353 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0014-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0014-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0014-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T19:19:08Z","timestamp":1559935148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0014-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,8]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0014-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,6,8]]},"assertion":[{"value":"6 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}