{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T01:27:46Z","timestamp":1777166866088,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,11,27]],"date-time":"2014-11-27T00:00:00Z","timestamp":1417046400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11590-014-0835-6","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T13:53:56Z","timestamp":1417442036000},"page":"1569-1583","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["The multiple traveling salesmen problem with moving targets"],"prefix":"10.1007","volume":"9","author":[{"given":"Anke","family":"Stieber","sequence":"first","affiliation":[]},{"given":"Armin","family":"F\u00fcgenschuh","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Epp","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Knapp","sequence":"additional","affiliation":[]},{"given":"Hendrik","family":"Rothe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,27]]},"reference":[{"key":"835_CR1","doi-asserted-by":"crossref","unstructured":"F\u00fcgenschuh, A.: Parametrized greedy heuristics in theory and practice. In: Aguilera, M., Blum, C., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Second International Workshop, HM 2005, Barcelona, pp. 21\u201331 (2005)","DOI":"10.1007\/11546245_3"},{"key":"835_CR2","doi-asserted-by":"crossref","unstructured":"F\u00fcgenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, R.W.K., Nemhauser, G. (eds.) Handbook on Discrete Optimization. Series Handbooks in Operations Research and Management Science, vol. 12, pp. 69\u2013122. Elsevier, Amsterdam (2005)","DOI":"10.1016\/S0927-0507(05)12002-7"},{"key":"835_CR3","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. W. H Freeman and Company, New York (1979)"},{"key":"835_CR4","unstructured":"Gavish, B., Graves, S.: The traveling salesman problem and related problems. In: Technical Report, OR 078\u201378, Operations Research Center, Massachusetts Institute of Technology, Cambridge (1978)"},{"key":"835_CR5","first-page":"453","volume-title":"Proceedings of the European Symposium on Algorithms. Lecture Notes in Computer Science","author":"C Helvig","year":"1998","unstructured":"Helvig, C., Robins, G., Zelikovsky, A.: Moving-target TSP and related problems. In: Bilardi, A.P.G., Italiano, G.F., Pucci, G. (eds.) Proceedings of the European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1461, pp. 453\u2013464. Springer Verlag, Berlin (1998)"},{"issue":"1","key":"835_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0196-6774(03)00075-0","volume":"49","author":"C Helvig","year":"2003","unstructured":"Helvig, C., Robins, G., Zelikovsky, A.: The moving-target traveling salesman problem. J. Algorithms 49(1), 153\u2013174 (2003)","journal-title":"J. Algorithms"},{"key":"835_CR7","unstructured":"IBM ILOG CPLEX: http:\/\/www.ibm.com\/software\/integration\/optimization\/cplex\/ (2013). Accessed 21 Feb 2014"},{"key":"835_CR8","first-page":"171","volume":"11","author":"Q Jiang","year":"2005","unstructured":"Jiang, Q., Sarker, R., Abbass, H.: Tracking moving targets and the non-stationary traveling salesman problem. Complex. Int. 11, 171\u2013179 (2005)","journal-title":"Complex. Int."},{"issue":"2","key":"835_CR9","first-page":"327","volume":"2","author":"P Jindal","year":"2011","unstructured":"Jindal, P., Kumar, A., Kumar, S.: Multiple target intercepting traveling salesman problem. Int. J. Comput. Sci. Technol. 2(2), 327\u2013331 (2011)","journal-title":"Int. J. Comput. Sci. Technol."},{"key":"835_CR10","unstructured":"Knapp, M., Rothe, H.: Concept for simulating engagement strategies for C-RAM systems using laser weapons. In: Proceedings of the DMMS (2012)"},{"key":"835_CR11","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E Lawler","year":"1985","unstructured":"Lawler, E., Lenstra, J., Rinnooy, A., Shmoys, D.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)"},{"key":"835_CR12","unstructured":"Liu, C.H.: The moving-target traveling salesman problem with resupply. In: Technical report, The National Chung Cheng University Library. http:\/\/ccur.lib.ccu.edu.tw\/handle\/987654321\/7877 (2013)"},{"key":"835_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"835_CR14","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer Verlag, Berlin (1994)"},{"key":"835_CR15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01096737","volume":"3","author":"ZB Zabinsky","year":"1993","unstructured":"Zabinsky, Z.B., Smith, R.L., Mcdonald, J.F., Edwin, H., Kaufman, D.E.: Improving hit-and-run for global optimization. J. Glob. Optim. 3, 171\u2013192 (1993)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0835-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0835-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0835-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:41Z","timestamp":1559409101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0835-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,27]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["835"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0835-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,27]]}}}