{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:12:14Z","timestamp":1742976734858,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_1","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing an Upper Bound for the Longest Edge in an Optimal TSP-Solution"],"prefix":"10.1007","author":[{"given":"Hans","family":"Achatz","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kleinschmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Achatz, H., Kleinschmidt, P., & Paparrizos, K. (1991). A dual forest algorithm for the assignment problem. In P. Gritzmann, B. Sturmfels & V. Klee (Eds.), Applied geometry and discrete mathematics. The Victor Klee festschrift (pp. 1\u201310). Providence, R.I.: AMS (DIMACS\u20194).","DOI":"10.1090\/dimacs\/004\/01"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Achatz, H. (1999). Sensitivity analysis of the bipartite weighted matching problem. In P. Kall (Ed.), Operations Research Proceedings 1998. Selected Papers of the International Conference on Operations Research, Z\u00fcrich (pp. 135\u2013141). Aug31\u2013Sept 3, 1998. Berlin: Springer.","DOI":"10.1007\/978-3-642-58409-1_12"},{"key":"1_CR3","unstructured":"Applegate, D. L., Bixby, R. E., Chv\u00e1tal, V., & Cook, W. J. (2007). The traveling salesman problem. A computational story. Princeton, NJ: Princeton University Press (Princeton series in applied mathematics)."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSPLIB\u2014a traveling salesman problem library. ORSA Journal on Computing, 3, 376\u2013384.","journal-title":"ORSA Journal on Computing"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T06:04:57Z","timestamp":1676873097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_1","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}