{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:06:22Z","timestamp":1765231582683},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1007\/bf01432809","type":"journal-article","created":{"date-parts":[[2005,4,11]],"date-time":"2005-04-11T23:39:32Z","timestamp":1113262772000},"page":"183-217","source":"Crossref","is-referenced-by-count":9,"title":["Provably good solutions for the traveling salesman problem"],"prefix":"10.1007","volume":"40","author":[{"given":"Michael","family":"J\ufffdnger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Thienel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JL Bentley","year":"1992","unstructured":"Bentley JL (1992) Experiments on geometric traveling salesman heuristics. ORSA Journal on Computing 4:387?411","journal-title":"ORSA Journal on Computing"},{"key":"CR2","volume-title":"Report 388","author":"N Christofides","year":"1976","unstructured":"Christofides N (1976) Worst case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12:568?581","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H Crowder","year":"1980","unstructured":"Crowder H, Padberg MW (1980) Solving large-scale symmetric traveling salesman problems to optimality. Management Science 26:495?509","journal-title":"Management Science"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01594929","volume":"50","author":"U Derigs","year":"1991","unstructured":"Derigs U, Metz A (1991) Solving (large-scale) matching problems combinatorically. Mathematical Programming 50:113?121","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"B 69","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards B 69:125?130","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel M, Holland O (1991) Solution of large-scale symmetric traveling salesman problems. Mathematical Programming 51:141?202","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Johnson DS (1990) Local optimization and the traveling salesman problem. Proceedings of the 17th colloquium on automata, languages and programming, Springer Verlag 446?461","DOI":"10.1007\/BFb0032050"},{"key":"CR9","unstructured":"J\u00fcnger M, Mutzel P (1993) Solving the maximum weight planar subgraph problem by branch & cut. Proceedings of the third IPCO conference 479?492"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"J\u00fcnger M, Reinelt G, Rinaldi G (1994) The traveling salesman problem. to appear In: Ball M, Magnanti T, Monma CL, Nemhauser G (eds) Handbook on Operations Research and Management Sciences: Networks, North Holland","DOI":"10.1016\/S0927-0507(05)80121-5"},{"key":"CR11","volume-title":"The art of computer programming, volume 3, sorting and searching","author":"DE Knuth","year":"1973","unstructured":"Knuth DE (1973) The art of computer programming, volume 3, sorting and searching, Addison-Wesley, Reading, Massachusetts"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Operations Research 21:498?516","journal-title":"Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"MW Padberg","year":"1982","unstructured":"Padberg MW, Rao MR (1982) Odd minimum cut sets and b-matchings. Mathematics of Operations Research 7:67?80","journal-title":"Mathematics of Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"MW Padberg","year":"1990","unstructured":"Padberg MW, Rinaldi G (1990) Facet identification for the symmetric traveling salesman polytope. Mathematical Programming 47:219?257","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"MW Padberg","year":"1991","unstructured":"Padberg MW, Rinaldi G (1991) A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33:60?100","journal-title":"SIAM Review"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB?A traveling salesman problem library. ORSA Journal on Computing 3:376?384","journal-title":"ORSA Journal on Computing"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.4.2.206","volume":"4","author":"G Reinelt","year":"1992","unstructured":"Reinelt G (1992) Fast heuristics for large geometric traveling salesman problems. ORSA Journal on Computing 4:206?217","journal-title":"ORSA Journal on Computing"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01432809.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01432809\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01432809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T19:20:04Z","timestamp":1586200804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01432809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["BF01432809"],"URL":"https:\/\/doi.org\/10.1007\/bf01432809","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}