{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T22:00:12Z","timestamp":1770588012031,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613107","type":"print"},{"value":"9783540684534","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_24","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:27:28Z","timestamp":1330291648000},"page":"316-329","source":"Crossref","is-referenced-by-count":8,"title":["Implementation of a linear time algorithm for certain generalized traveling salesman problems"],"prefix":"10.1007","author":[{"given":"Neil","family":"Simonetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egon","family":"Balas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1287\/opre.31.5.938","volume":"31","author":"E. Baker","year":"1983","unstructured":"E. Baker, \u201cAn Exact Algorithm for the Time-Constrained Traveling Salesman Problem.\u201d Operations Research, 31, (1983) 938\u2013945.","journal-title":"Operations Research"},{"key":"24_CR2","unstructured":"E. Balas, \u201cNew Classes of Efficiently Solvable Generalized Traveling Salesman Problems,\u201d Management Science Research Report #MSRR-611, Graduate School of Industrial Administration, Carnegie Mellon University, March 1995."},{"key":"24_CR3","unstructured":"M. Gendreau, A. Hertz, G. Laporte, M. Stan, \u201cA Generalized Insertion Heuristics for the Traveling Salesman Problem with Time Windows.\u201d Publication CRT-95-07, Centre de recherche sur les transports, Montr\u00e9al, January 1995."},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","volume":"28","author":"P. Kanellakis","year":"1980","unstructured":"P. Kanellakis, C. Papadimiriou, \u201cLocal Search for the Traveling Salesman Problem.\u201d Operations Research, 28, (1980) 1086\u20131099.","journal-title":"Operations Research"},{"key":"24_CR5","first-page":"495","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin, B. W. Kernighan, \u201cAn Effective Heuristic Algorithm for the Traveling Salesman Problem.\u201d Operations Research, 21, (1973) 495\u2013516.","journal-title":"Operations Research"},{"key":"24_CR6","unstructured":"J.-Y. Potvin, S. Bengio, \u201cA Genetic Approach to the Vehicle Routing Problem with Time Windows.\u201d Publication CRT-953, Centre de recherche sur les transports, Montr\u00e9al, 1993."},{"key":"24_CR7","unstructured":"B. Repetto Upper and Lower Bounding Procedures for the Asymmetric Traveling Salesman Problem. Ph.D. Thesis, GSIA, Carnegie Mellon University, April 1994."},{"key":"24_CR8","unstructured":"B. Repetto, personal communication."},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"M. M. Solomon, \u201cAlgorithms for the Vehicle Routing and Scheduling with Time Windows Constraints.\u201d Operations Research, 35, (1987) 254\u2013265.","journal-title":"Operations Research"},{"key":"24_CR10","unstructured":"J. Tama, personal communication."},{"key":"24_CR11","unstructured":"United States Census Bureau, http:\/\/www.census.gov\/cgi-bin\/gazetteer"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:30:50Z","timestamp":1619573450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}