{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:03:32Z","timestamp":1725843812939},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319273396"},{"type":"electronic","value":"9783319273402"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27340-2_83","type":"book-chapter","created":{"date-parts":[[2015,12,16]],"date-time":"2015-12-16T13:40:44Z","timestamp":1450273244000},"page":"673-680","source":"Crossref","is-referenced-by-count":1,"title":["An Almost Time Optimal Route Planning Method for Complex Manufacturing Topologies"],"prefix":"10.1007","author":[{"given":"Matthias","family":"J\u00f6rgl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubert","family":"Gattringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,17]]},"reference":[{"key":"83_CR1","first-page":"393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"83_CR2","series-title":"Mathematics of Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6333-3","volume-title":"A Practical Guide to Splines","author":"C Boor de","year":"1978","unstructured":"de Boor, C.: A Practical Guide to Splines. Mathematics of Computation. Springer, New York (1978)"},{"key":"83_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Research Report, Carnegie-Mellon University, Pittsburgh (1976)"},{"issue":"1","key":"83_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1), 255\u2013282 (1981)","journal-title":"Math. Program."},{"key":"83_CR5","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connecting networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"83_CR6","unstructured":"Gabow, H.N.: A scaling algorithm for weighted matching on general graphs. Ph.D. thesis, Stanford University (1974)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2013 EUROCAST 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27340-2_83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T20:07:47Z","timestamp":1559333267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27340-2_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319273396","9783319273402"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27340-2_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}