{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:52:24Z","timestamp":1770745944677,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1007\/bf01585701","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:34:23Z","timestamp":1114677263000},"page":"173-197","source":"Crossref","is-referenced-by-count":61,"title":["An additive bounding procedure for the asymmetric travelling salesman problem"],"prefix":"10.1007","volume":"53","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","volume":"21","author":"E. Balas","year":"1981","unstructured":"E. Balas and N. Christofides, \u201cA restricted Lagrangean approach to the traveling salesman problem,\u201dMathematical Programming 21 (1981) 19\u201346.","journal-title":"Mathematical Programming"},{"key":"CR2","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E. Balas","year":"1985","unstructured":"E. Balas and P. Toth, \u201cBranch and bound methods,\u201d in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","volume":"19","author":"M. Bellmore","year":"1971","unstructured":"M. Bellmore and J.C. Malone, \u201cPathology of traveling salesman subtour elimination algorithms,\u201dOperations Research 19 (1971) 278\u2013307.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230090403","volume":"9","author":"P.M. Camerini","year":"1979","unstructured":"P.M. Camerini, L. Fratta and F. Maffioli, \u201cA note on finding optimum branchings,\u201dNetworks 9 (1979) 309\u2013312.","journal-title":"Networks"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/net.3230100202","volume":"10","author":"P.M. Camerini","year":"1980","unstructured":"P.M. Camerini, L. Fratta and F. Maffioli, \u201cThek best spanning arborescences of a network,\u201dNetworks 10 (1980) 91\u2013110.","journal-title":"Networks"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230190505","volume":"19","author":"G. Carpaneto","year":"1989","unstructured":"G. Carpaneto, M. Dell'Amico, M. Fischetti and P. Toth, \u201cA branch and bound algorithm for the multiple depot vehicle scheduling problem,\u201dNetworks 19 (1989) 531\u2013548.","journal-title":"Networks"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01589105","volume":"45","author":"G. Carpaneto","year":"1989","unstructured":"G. Carpaneto, M. Fischetti and P. Toth, \u201cNew lower bounds for the symmetric travelling salesman problem,\u201dMathematical Programming (Series B) 45 (1989) 233\u2013254.","journal-title":"Mathematical Programming (Series B)"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"G. Carpaneto, S. Martello and P. Toth, \u201cAlgorithms and codes for the assignment problem,\u201dAnnals of Operations Research 7 (1988).","DOI":"10.1007\/BF02288323"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","volume":"26","author":"G. Carpaneto","year":"1980","unstructured":"G. Carpaneto and P. Toth, \u201cSome new branching and bounding criteria for the asymmetric travelling salesman problem,\u201dManagement Science 26 (1980) 736\u2013743.","journal-title":"Management Science"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/opre.20.5.1044","volume":"20","author":"N. Christofides","year":"1972","unstructured":"N. Christofides, \u201cBounds for the traveling salesman problem,\u201dOperations Research 20 (1972) 1044\u20131056.","journal-title":"Operations Research"},{"key":"CR11","first-page":"233","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, \u201cOptimum branchings,\u201dJournal of Research of the National Bureau of Standards-B. Mathematics and Mathematical Physics 71B (1967) 233\u2013240.","journal-title":"Journal of Research of the National Bureau of Standards-B. Mathematics and Mathematical Physics"},{"key":"CR12","volume-title":"\u201cAn efficient algorithm for the min-sum arborescence problem,\u201d Technical Report OR\/87\/6, DEIS","author":"M. Fischetti","year":"1987","unstructured":"M. Fischetti and P. Toth, \u201cAn efficient algorithm for the min-sum arborescence problem,\u201d Technical Report OR\/87\/6, DEIS, University of Bologna (Bolonga, 1987)."},{"key":"CR13","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Fischetti","year":"1988","unstructured":"M. Fischetti and P. Toth, \u201cAn additive approach for the optimal solution of the prize-collecting travelling salesman problem,\u201d in: B.L. Golden and A.A. Assad, eds.,Vehicle Routing: Methods and Studies (North-Holland, Amsterdam, 1988)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","volume":"37","author":"M. Fischetti","year":"1989","unstructured":"M. Fischetti and P. Toth, \u201cAn additive bounding procedure for combinatorial optimization problems,\u201dOperations Research 37 (1989) 319\u2013328.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580218","volume":"6","author":"D.R. Fulkerson","year":"1974","unstructured":"D.R. Fulkerson, \u201cPacking rooted directed cuts in a weighted directed graph,\u201dMathematical Programming 6 (1974) 1\u201313.","journal-title":"Mathematical Programming"},{"key":"CR16","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, \u201cPolyhedral theory,\u201d in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"M. Held and R.M. Karp, \u201cThe traveling-salesman problem and minimum spanning tress: Part II,\u201dMathematical Programming 1 (1971) 6\u201325.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0377-2217(85)90310-8","volume":"19","author":"G.A.P. Kindervater","year":"1985","unstructured":"G.A.P. Kindervater, A. Volgenant, G. de Leve and V. van Gijlswijk, \u201cOn dual solutions of the linear assignment problem,\u201dEuropean Journal of Operational Research 19 (1985) 76\u201381.","journal-title":"European Journal of Operational Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/362588.362593","volume":"14","author":"P.D. Krolak","year":"1971","unstructured":"P.D. Krolak, W. Felts and G. Marble, \u201cA man-machine approach toward solving the traveling salesman problem,\u201dCommunications of the Association on Computing Machinery 14 (1971) 327\u2013334.","journal-title":"Communications of the Association on Computing Machinery"},{"key":"CR20","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"CR21","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E.L. Lawler","year":"1985","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985)."},{"key":"CR22","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"M.W. Padberg","year":"1985","unstructured":"M.W. Padberg and M. Gr\u00f6tschel, \u201cPolyhedral computations,\u201d in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985)."},{"key":"CR23","volume-title":"Optimizing a 48-city traveling salesman problem: A case study in combinatorial problem solving","author":"G. Rinaldi","year":"1985","unstructured":"G. Rinaldi and L.A. Yarrow, \u201cOptimizing a 48-city traveling salesman problem: A case study in combinatorial problem solving,\u201d Preprint R. 122, IASI-CNR (Rome, 1985)."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0167-5060(08)70754-4","volume":"1","author":"T.H.C. Smith","year":"1977","unstructured":"T.H.C. Smith, V. Srinivasan and G.L. Thompson, \u201cComputational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems,\u201dAnnals of Discrete Mathematics 1 (1977) 479\u2013493.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"R.E. Tarjan, \u201cDepth-first search and linear algorithms,\u201dSIAM Journal on Computing 1 (1972) 146\u2013160.","journal-title":"SIAM Journal on Computing"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"R.E. Tarjan","year":"1977","unstructured":"R.E. Tarjan, \u201cFinding optimum branchings,\u201dNetworks 7 (1977) 25\u201335.","journal-title":"Networks"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585701.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585701\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:30Z","timestamp":1556897550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["BF01585701"],"URL":"https:\/\/doi.org\/10.1007\/bf01585701","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}