{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:09:12Z","timestamp":1768748952476,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540005803","type":"print"},{"value":"9783540364788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36478-1_8","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:33:12Z","timestamp":1192890792000},"page":"64-77","source":"Crossref","is-referenced-by-count":7,"title":["Solving Real-World ATSP Instances by Branch-and-Cut"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,30]]},"reference":[{"key":"8_CR1","unstructured":"D. Applegate, R.E. Bixby, V. Chv\u00e1tal, and W. Cook. Concorde-a code for solving traveling salesman problems. 12\/15\/1999 Release. http:\/\/www.keck.caam.rice.edu\/concorde.html ."},{"key":"8_CR2","first-page":"645","volume":"ICM III","author":"D. Applegate","year":"1998","unstructured":"D. Applegate, R.E. Bixby, V. Chv\u00e1tal, and W. Cook. On the solution of traveling salesman problems. Documenta Mathematica, Extra Volume ICM III:645\u2013656, 1998.","journal-title":"Documenta Mathematica"},{"key":"8_CR3","volume-title":"Hamiltonian Path Problems in the On-line Optimization of Flexible Manufacturing Systems","author":"N. Ascheuer","year":"1995","unstructured":"N. Ascheuer. Hamiltonian Path Problems in the On-line Optimization of Flexible Manufacturing Systems. PhD thesis, Technische Universit\u00e4t Berlin, Germany, 1995."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","volume":"36","author":"N. Ascheuer","year":"2000","unstructured":"N. Ascheuer, M. Fischetti, and M. Gr\u00f6tschel. A polyhedral study of the asymmmetric travelling salesman problem with time windows. Networks, 36:69\u201379, 2000.","journal-title":"Networks"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N. Ascheuer","year":"2001","unstructured":"N. Ascheuer, M. Fischetti, and M. Gr\u00f6tschel. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming, Ser. A, 90:475\u2013506, 2001.","journal-title":"Mathematical Programming, Ser. A"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N. Ascheuer","year":"2000","unstructured":"N. Ascheuer, M. J\u00fcnger, and G. Reinelt. A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Computational Optimization and Applications, 17:61\u201384, 2000.","journal-title":"Computational Optimization and Applications"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/0402038","volume":"2","author":"E. Balas","year":"1989","unstructured":"E. Balas. The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM Journal on Discrete Mathematics, 2:425\u2013451, 1989.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR8","unstructured":"E. Balas. Personal communication, 2000."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas and M. Fischetti. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Mathematical Programming, Ser. A, 58:325\u2013352, 1993.","journal-title":"Mathematical Programming, Ser. A"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"E. Balas and M. Fischetti. Polyhedral theory for the asymmetric traveling salesman problem. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 117\u2013168. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/0-306-48213-4_3"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1145\/212066.212084","volume":"21","author":"G. Carpaneto","year":"1995","unstructured":"G. Carpaneto, M. Dell\u2019Amico, and P. Toth. Algorithm CDT: a subroutine for the exact solution of large-scale asymmetric traveling salesman problems. ACM Transactions on Mathematical Software, 21:410\u2013415, 1995.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"8_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-44808-X_3","volume-title":"The asymmetric traveling salesman problem: Algorithms, instance generators, and tests","author":"J. Cirasella","year":"2001","unstructured":"J. Cirasella, D.S. Johnson, L.A. McGeoch, and W. Zhang. The asymmetric traveling salesman problem: Algorithms, instance generators, and tests. In A.L. Buchsbaum and J. Snoeyink, editors, Proceedings of ALENEX\u201901, volume 2153 of Lecture Notes in Computer Science, pages 32\u201359. Springer-Verlag, Heidelberg, 2001."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/moor.16.1.42","volume":"16","author":"M. Fischetti","year":"1991","unstructured":"M. Fischetti. Facets of the asymmetric traveling salesman polytope. Mathematics of Operations Research, 16:42\u201356, 1991.","journal-title":"Mathematics of Operations Research"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/mnsc.47.6.833.9810","volume":"47","author":"M. Fischetti","year":"2001","unstructured":"M. Fischetti, A. Lodi, S. Martello, and P. Toth. A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science, 47:833\u2013850, 2001.","journal-title":"Management Science"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"M. Fischetti, A. Lodi, and P. Toth. Exact methods for the asymmetric traveling salesman problem. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 169\u2013205. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/0-306-48213-4_4"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01585701","volume":"53","author":"M. Fischetti","year":"1992","unstructured":"M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, Ser. A, 53:173\u2013197, 1992.","journal-title":"Mathematical Programming, Ser. A"},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","volume":"43","author":"M. Fischetti","year":"1997","unstructured":"M. Fischetti and P. Toth. A polyhedral approach to the asymmetric traveling salesman problem. Management Science, 43:1520\u20131536, 1997.","journal-title":"Management Science"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"A.M.H. Gerards","year":"1986","unstructured":"A.M.H. Gerards and A. Schrijver. Matrices with the Edmonds-Johnson property. Combinatorica, 6:365\u2013379, 1986.","journal-title":"Combinatorica"},{"key":"8_CR19","first-page":"251","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M.W. Padberg. Polyhedral theory. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and Shmoys D.B. eds., editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 251\u2013305. Wiley, Chichester, 1985."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","volume":"2","author":"R. Jonker","year":"1983","unstructured":"R. Jonker and T. Volgenant. Transforming asymmetric into symmetric traveling salesman problems. Operations Research Letters, 2:161\u2013163, 1983.","journal-title":"Operations Research Letters"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, G. Reinelt, and G. Rinaldi. The traveling salesman problem. In M. Ball, T.L. Magnanti, C.L. Monma, and G. Nemhauser, editors, Network Models, volume 7 of Handbooks in Operations Research and Management Science, pages 255\u2013330. North Holland, Amsterdam, 1995.","DOI":"10.1016\/S0927-0507(05)80121-5"},{"key":"8_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85\u2013103. Plenum Press, New York, 1972."},{"key":"8_CR23","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1287\/mnsc.44.12.1637","volume":"44","author":"A. L\u00f6bel","year":"1998","unstructured":"A. L\u00f6bel. Vehicle scheduling in public transit and Lagrangean pricing. Management Science, 44:1637\u20131649, 1998.","journal-title":"Management Science"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/356022.356030","volume":"9","author":"S. Martello","year":"1983","unstructured":"S. Martello. An enumerative algorithm for finding Hamiltonian circuits in a directed graph. ACM Transactions on Mathematical Software, 9:131\u2013138, 1983.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"D. Naddef. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 29\u2013116. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/0-306-48213-4_2"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"M.W. Padberg and G. Rinaldi. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, Ser. A, 47:19\u201336, 1990.","journal-title":"Mathematical Programming, Ser. A"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"M.W. Padberg and G. Rinaldi. Facet identification for the symmetric traveling salesman polytope. Mathematical Programming, Ser. A, 47:219\u2013257, 1990.","journal-title":"Mathematical Programming, Ser. A"},{"key":"8_CR28","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"G. Reinelt. TSPLIB-a traveling salesman problem library. ORSA Journal on Computing, 3:376\u2013384, 1991. http:\/\/www.crpc.rice.edu\/softlib\/tsplib\/ .","journal-title":"ORSA Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization \u2014 Eureka, You Shrink!"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36478-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:02:36Z","timestamp":1556920956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36478-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005803","9783540364788"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-36478-1_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}