{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:35Z","timestamp":1725558935240},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_19","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:01:42Z","timestamp":1278082902000},"page":"222-234","source":"Crossref","is-referenced-by-count":14,"title":["Tolerance Based Algorithms for the ATSP"],"prefix":"10.1007","author":[{"given":"Boris","family":"Goldengorin","sequence":"first","affiliation":[]},{"given":"Gerard","family":"Sierksma","sequence":"additional","affiliation":[]},{"given":"Marcel","family":"Turkensteen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"The Traveling Salesman Problem","author":"E. Balas","year":"1985","unstructured":"Balas, E., Toth, P.: Branch and bound methods. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem, ch. 10, John Wiley & Sons, Chichester (1985)"},{"key":"19_CR2","first-page":"361","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization, pp. 361\u2013402. John Wiley & Sons, Chichester (1998)"},{"key":"19_CR3","first-page":"169","volume-title":"Chapter 2 in: The Traveling Salesman Problem and Its Variations","author":"M. Fischetti","year":"2002","unstructured":"Fischetti, M., Lodi, A., Toth, P.: Exact methods for the asymmetric traveling salesman problem. In: Gutin, G., Punnen, A.P. (eds.) Chapter 2 in: The Traveling Salesman Problem and Its Variations, pp. 169\u2013194. Kluwer, Dordrecht (2002)"},{"key":"19_CR4","first-page":"369","volume-title":"Chapter 9 in: The Traveling Salesman Problem and Its Variations","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A.P. (eds.) Chapter 9 in: The Traveling Salesman Problem and Its Variations, pp. 369\u2013444. Kluwer, Dordrecht (2002)"},{"key":"19_CR5","first-page":"445","volume-title":"Chapter 10 in: The Traveling Salesman Problem and Its Variations","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovich, A.: Experimental analysis of heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) Chapter 10 in: The Traveling Salesman Problem and Its Variations, pp. 445\u2013489. Kluwer, Dordrecht (2002)"},{"key":"19_CR6","unstructured":"Goldengorin, B., Sierksma, G.: Combinatorial optimization tolerances calculated in linear time. SOM Research Report 03A30, University of Groningen, Groningen, The Netherlands (2003), \n \n http:\/\/www.ub.rug.nl\/eldoc\/som\/a\/03A30\/03a30.pdf"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-1-4757-2807-1_4","volume-title":"Advances in computational and stochastic optimization, logic programming, and heuristic search","author":"H. Greenberg","year":"1998","unstructured":"Greenberg, H.: An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: Woodruff, D.L. (ed.) Advances in computational and stochastic optimization, logic programming, and heuristic search, pp. 97\u2013148. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernigan traveling salesman heuristic. European Journal of Operational Research\u00a0126, 106\u2013130 (2000)","journal-title":"European Journal of Operational Research"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L.J. Hubert","year":"1985","unstructured":"Hubert, L.J., Arabie, P.: Comparing Partitions. Journal of Classification\u00a02, 193\u2013218 (1985)","journal-title":"Journal of Classification"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(91)90044-W","volume":"30","author":"M. Libura","year":"1991","unstructured":"Libura, M.: Sensitivity analysis for minimum hamiltonian path and traveling salesman problems. Discrete Applied Mathematics\u00a030, 197\u2013211 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR11","first-page":"29","volume-title":"Chapter 2 in: The Traveling Salesman Problem and Its Variations","author":"D. Naddef","year":"2002","unstructured":"Naddef, D.: Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In: Gutin, G., Punnen, A.P. (eds.) Chapter 2 in: The Traveling Salesman Problem and Its Variations, pp. 29\u2013116. Kluwer, Dordrecht (2002)"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB \u2013 a Traveling Salesman Problem Library. ORSA Journal on Computing\u00a03, 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:29:59Z","timestamp":1619998199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}