{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:33:27Z","timestamp":1725978807740},"publisher-location":"Cham","reference-count":4,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319899190"},{"type":"electronic","value":"9783319899206"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89920-6_30","type":"book-chapter","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:59:40Z","timestamp":1527253180000},"page":"213-219","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids"],"prefix":"10.1007","author":[{"given":"Anja","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Jellen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,26]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1137\/S0097539797320281","volume":"29","author":"EM Arkin","year":"1999","unstructured":"Arkin, E. M., Chiang, Y.-J., Mitchell, J. S. B., Skiena, S. S., & Yang, T.-C. (1999). On the maximum scatter traveling salesperson problem. SIAM Journal on Computing, 29(2), 515\u2013544.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR2","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Operations Research, 2, 393\u2013410.","journal-title":"Operations Research"},{"issue":"3","key":"30_CR3","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. (2017). The traveling salesman problem on grids with forbidden neighborhoods. Journal of Combinatorial Optimization, 34(3), 891\u2013915.","journal-title":"Journal of Combinatorial Optimization"},{"unstructured":"Stock, I. (2017). The Maximum Scatter TSP on a Regular Grid: How to Avoid Heat Peaks in Additive Manufacturing. Ph.D thesis, University of Bayreuth.","key":"30_CR4"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89920-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T13:11:30Z","timestamp":1527253890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89920-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899190","9783319899206"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89920-6_30","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2018]]}}}