{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:30:01Z","timestamp":1759667401325,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T00:00:00Z","timestamp":1522368000000},"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":["J Heuristics"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10732-018-9370-4","type":"journal-article","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:39:43Z","timestamp":1522402783000},"page":"617-644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["All Colors Shortest Path problem on trees"],"prefix":"10.1007","volume":"24","author":[{"given":"Mehmet Berkehan","family":"Ak\u00e7ay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5145-7778","authenticated-orcid":false,"given":"H\u00fcseyin","family":"Akcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cem","family":"Evrendilek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,30]]},"reference":[{"key":"9370_CR1","unstructured":"Ak\u00e7ay, M.B.: All colors shortest path problem on trees. Master\u2019s thesis, Izmir University of Economics, Izmir (2015)"},{"key":"9370_CR2","unstructured":"Bilge, Y.C., \u00c7a\u011fatay, D., Gen\u00e7, B., Sar\u0131, M., Akcan, H., Evrendilek, C.: All colors shortest path problem (2015). arXiv:1507.06865"},{"issue":"3","key":"9370_CR3","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":"9370_CR4","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"},{"key":"9370_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"1","key":"9370_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"key":"9370_CR7","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"9370_CR8","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 585\u2013594. ACM (2003)","DOI":"10.1145\/780542.780628"},{"key":"9370_CR9","unstructured":"IBM ILOG CPLEX Optimizer. http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/ . Accessed 20 July 2015"},{"key":"9370_CR10","doi-asserted-by":"crossref","unstructured":"Ihler, E.: The complexity of approximating the class Steiner tree problem. In: Graph-Theoretic Concepts in Computer Science, pp. 85\u201396. Springer, Berlin (1992)","DOI":"10.1007\/3-540-55121-2_8"},{"issue":"1","key":"9370_CR11","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), 173\u2013194 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9370_CR12","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"issue":"NB 2","key":"9370_CR13","first-page":"43","volume":"3","author":"H Labordere","year":"1969","unstructured":"Labordere, H.: Record balancing problem: a dynamic programming solution of a generalized travelling salesman problem. Rev. Fr. Inf. Rech. Oper. 3(NB 2), 43 (1969)","journal-title":"Rev. Fr. Inf. Rech. Oper."},{"issue":"1","key":"9370_CR14","first-page":"61","volume":"21","author":"G Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: Generalized traveling salesman problem through n-sets of nodes\u2014an integer programming approach. Inf. Syst. Oper. Res. 21(1), 61\u201375 (1983)","journal-title":"Inf. Syst. Oper. Res."},{"issue":"2","key":"9370_CR15","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."},{"key":"9370_CR16","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics. Wiley, New York (1985)"},{"issue":"1","key":"9370_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0255(93)90133-7","volume":"74","author":"YN Lien","year":"1993","unstructured":"Lien, Y.N., Ma, E., Wah, B.W.S.: Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem. Inf. Sci. 74(1), 177\u2013189 (1993)","journal-title":"Inf. Sci."},{"issue":"4","key":"9370_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"YS 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":"9370_CR19","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."},{"key":"9370_CR20","doi-asserted-by":"crossref","unstructured":"Pop, P.C.: The generalized minimum spanning tree problem. Ph.D. thesis, University of Twente (2002)","DOI":"10.1016\/S0377-2217(02)00213-8"},{"issue":"2","key":"9370_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/B:JMMA.0000036579.83218.8d","volume":"3","author":"PC Pop","year":"2004","unstructured":"Pop, P.C.: New models of the generalized minimum spanning tree problem. J. Math. Model. Algorithms 3(2), 153\u2013166 (2004)","journal-title":"J. Math. Model. Algorithms"},{"key":"9370_CR22","doi-asserted-by":"crossref","unstructured":"Pop, P.C., Kern, W., Still, G.: An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Technical report 1577, Department of Applied Mathematics, University of Twente (2001)","DOI":"10.1016\/S1571-0653(05)80085-X"},{"issue":"3","key":"9370_CR23","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."},{"key":"9370_CR24","doi-asserted-by":"crossref","unstructured":"Pop, P.C., Matei, O., Sabo, C.: A hybrid diploid genetic based algorithm for solving the generalized traveling salesman problem. In: Hybrid Artificial Intelligent Systems\u201412th International Conference, HAIS 2017, Proceedings, La Rioja, Spain, 21\u201323 June 2017, pp. 149\u2013160 (2017)","DOI":"10.1007\/978-3-319-59650-1_13"},{"issue":"2","key":"9370_CR25","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2017.08.015","volume":"265","author":"PC Pop","year":"2018","unstructured":"Pop, P.C., Matei, O., Sabo, C., Petrovan, A.: A two-level solution approach for solving the generalized minimum spanning tree problem. Eur. J. Oper. Res. 265(2), 478\u2013487 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"9370_CR26","doi-asserted-by":"crossref","unstructured":"Reich, G., Widmayer, P.: Beyond Steiner\u2019s problem: a VLSI oriented generalization. In: Graph-theoretic Concepts in Computer Science, pp. 196\u2013210. Springer, Berlin (1990)","DOI":"10.1007\/3-540-52292-1_14"},{"key":"9370_CR27","unstructured":"Slavik, P.: The errand scheduling problem. Technical report, Department of Computer Science, SUNY, Buffalo (1997)"},{"key":"9370_CR28","first-page":"97","volume":"7","author":"S Srivastava","year":"1969","unstructured":"Srivastava, S., Kumar, S., Garg, R., Sen, P.: Generalized traveling salesman problem through n sets of nodes. Can. Oper. Res. Soc. J. 7, 97\u2013101 (1969)","journal-title":"Can. Oper. Res. Soc. J."},{"key":"9370_CR29","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-018-9370-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9370-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9370-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T15:30:22Z","timestamp":1570980622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-018-9370-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,30]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["9370"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9370-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2018,3,30]]},"assertion":[{"value":"25 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}