{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T11:26:12Z","timestamp":1676805972466},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":[[1989,8]]},"DOI":"10.1007\/bf01589105","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:22:34Z","timestamp":1114690954000},"page":"233-254","source":"Crossref","is-referenced-by-count":14,"title":["New lower bounds for the Symmetric Travelling Salesman Problem"],"prefix":"10.1007","volume":"45","author":[{"given":"G.","family":"Carpaneto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974)."},{"key":"CR2","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 Lagrangian approach to the Traveling Salesman Problem,\u201dMathematical Programming 21 (1981) 19\u201346.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","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).","DOI":"10.1002\/net.3230190505"},{"key":"CR4","first-page":"193","volume":"13","author":"G. Carpaneto","year":"1988","unstructured":"G. Carpaneto, S. Martello and P. Toth, \u201cAlgorithms and codes for the Assignment Problem,\u201d in: B. Simeone, P. Toth, G. Gallo, F. Maffioli and S. Pallottino, eds.,FORTRAN Codes for Network Optimization, Annals of Operations Research 13 (1988) 193\u2013223.","journal-title":"FORTRAN Codes for Network Optimization, Annals of Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1137\/0119070","volume":"19","author":"N. Christofides","year":"1970","unstructured":"N. Christofides, \u201cThe shortest Hamiltonian chain of a graph,\u201dSIAM Journal on Applied Mathematics 19 (1970) 689\u2013696.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \u201cA note on two problems in connexion with graphs,\u201dNumerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, \u201cOptimum branchings,\u201dJournal of Research of the National Bureau of Standards 71B (1967) 233\u2013240.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR8","volume-title":"\u201cAn efficient algorithm for the Min-Sum Arborescence Problem,\u201d Technical Report OR\/87\/7","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\/7, DEIS, University of Bologna (Bologna, 1987)."},{"key":"CR9","first-page":"319","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. Golden and A.A. Assad, eds.,Vehicle Routing: Methods and Studies (North-Holland, Amsterdam, 1988) pp. 319\u2013343."},{"key":"CR10","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":"CR11","unstructured":"M. Fischetti and P. Toth, \u201cAn additive bounding procedure for the Asymmetric Travelling Salesman Problem,\u201d submitted toMathematical Programming (1990)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/opre.34.5.698","volume":"34","author":"B. Gavish","year":"1986","unstructured":"B. Gavish and K. Srikanth, \u201cAn optimal method for large-scale multiple traveling salesman problems,\u201dOperations Research 34 (1986) 698\u2013717.","journal-title":"Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01585505","volume":"7","author":"K. Helbing Hansen","year":"1974","unstructured":"K. Helbing Hansen and J. Krarup, \u201cImprovements of the Held-Karp Algorithm for the Symmetric Traveling-Salesman Problem,\u201dMathematical Programming 7 (1974) 87\u201396.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, \u201cThe Traveling-Salesman Problem and minimum spanning trees,\u201dOperations Research 18 (1970) 1138\u20131162.","journal-title":"Operations Research"},{"key":"CR15","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 trees: Part II,\u201dMathematical Programming 1 (1971) 6\u201325.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal, \u201cOn the shortest spanning subtree of a graph and the Traveling Salesman Problem,\u201dProceedings of the American Mathematical Society 7 (1956) 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR17","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":"CR18","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, Chichester, 1985)."},{"key":"CR19","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, Chichester, 1985)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M.W. Padberg","year":"1987","unstructured":"M.W. Padberg and G. Rinaldi, \u201cOptimization of a 532-City Symmetric Traveling Salesman Problem by branch and cut,\u201dOperations Research Letters 6 (1987) 1\u20138.","journal-title":"Operations Research Letters"},{"key":"CR21","first-page":"1389","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim, \u201cShortest connection networks and some generalizations,\u201dBSTJ 36 (1957) 1389\u20131401.","journal-title":"BSTJ"},{"key":"CR22","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 and G.L. Thompson, \u201cA LIFO implicit enumeration search algorithm for the Symmetric Traveling Salesman Problem using Held and Karp's 1-tree relaxation,\u201dAnnals of Discrete Mathematics 1 (1977) 479\u2013493.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR23","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"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","volume":"9","author":"T. Volgenant","year":"1982","unstructured":"T. Volgenant and R. Jonker, \u201cA branch and bound algorithm for the Symmetric Traveling Salesman Problem based on the 1-tree relaxation,\u201dEuropean Journal of Operational Research 9 (1982) 83\u201389.","journal-title":"European Journal of Operational Research"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(83)90161-3","volume":"12","author":"T. Volgenant","year":"1983","unstructured":"T. Volgenant and R. Jonker, \u201cThe Symmetric Traveling Salesman Problem and edge exchanges in minimal 1-trees,\u201dEuropean Journal of Operational Research 12 (1983) 394\u2013403.","journal-title":"European Journal of Operational Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589105.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589105\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:31Z","timestamp":1556897791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01589105"],"URL":"https:\/\/doi.org\/10.1007\/bf01589105","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}