{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:00:06Z","timestamp":1743152406612,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030484385"},{"type":"electronic","value":"9783030484392"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48439-2_26","type":"book-chapter","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:04:52Z","timestamp":1600959892000},"page":"215-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Multiple Traveling Salesperson Problem on Regular Grids in Linear Time"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Jellen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Jessenitschnig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Knoblinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lackenbucher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerstin","family":"Maier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s10878-017-0119-z","volume":"34","author":"A Fischer","year":"2017","unstructured":"Fischer, A., Hungerl\u00e4nder, P.: The traveling salesman problem on grids with forbidden neighborhoods. J. Comb. Optim. 34(3), 891\u2013915 (2017)","journal-title":"J. Comb. Optim."},{"key":"26_CR2","unstructured":"Fischer, A., Hungerl\u00e4nder, P., Jellen, A.: The traveling salesperson problem with forbidden neighborhoods on regular 3D grids. In: Operations Research Proceedings, 2017. Springer, Cham (2018)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, pp. 10\u201322 (1976)","DOI":"10.1145\/800113.803626"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"2624","DOI":"10.1109\/COMST.2016.2560343","volume":"18","author":"S Hayat","year":"2016","unstructured":"Hayat, S., Yanmaz, E., Muzaffar, R.: Survey on unmanned aerial vehicle networks for civil applications: a communications viewpoint. IEEE Commun. Surv. Tutorials 18, 2624\u20132661 (2016)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1007\/s00500-017-2705-5","volume":"22","author":"X Xu","year":"2018","unstructured":"Xu, X., Yuan, H., Liptrott, M., Trovati, M.: Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput. 22, 6567\u20136581 (2018)","journal-title":"Soft Comput."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48439-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:09:47Z","timestamp":1600960187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48439-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030484385","9783030484392"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48439-2_26","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}