{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T06:08:11Z","timestamp":1780553291177,"version":"3.54.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1971,12,1]],"date-time":"1971-12-01T00:00:00Z","timestamp":60393600000},"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":[[1971,12]]},"DOI":"10.1007\/bf01584070","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:27:04Z","timestamp":1114662424000},"page":"6-25","source":"Crossref","is-referenced-by-count":733,"title":["The traveling-salesman problem and minimum spanning trees: Part II"],"prefix":"10.1007","volume":"1","author":[{"given":"Michael","family":"Held","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard M.","family":"Karp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon","year":"1954","unstructured":"S. Agmon, \u201cThe relaxation method for linear inequalities,\u201dCanadian Journal of Mathematics 6 (1954) 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M. Bellmore","year":"1968","unstructured":"M. Bellmore and G.L. Nemhauser, \u201cThe traveling salesman problem: a survey\u201d,Operations Research 16 (1968) 538\u2013558.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"G.A. Croes, \u201cA method for solving traveling salesman problems,\u201dOperations Research 6 (1958) 791\u2013812.","journal-title":"Operations Research"},{"key":"CR4","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, \u201cSolution of a large scale traveling salesman problem\u201d,Operation Research 2 (1954) 393\u2013410.","journal-title":"Operation Research"},{"key":"CR5","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":"CR6","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D. Gale","year":"1968","unstructured":"D. Gale, \u201cOptimal assignments in an ordered set: an application of matroid theory,\u201dJournal of Combinatorial Theory 4 (1968) 176\u2013180.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR7","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":"CR8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"M. Held and R.M. Karp, \u201cA dynamic programming approach to sequencing problems,\u201dJournal of the Society for Industrial and Applied Mathematics 10 (1962) 196\u2013210.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","volume":"10","author":"L.L. Karg","year":"1964","unstructured":"L.L. Karg and G.L. Thompson, \u201cA heuristic approach to solving traveling salesman problems,\u201dManagement Science 10 (1964) 225\u2013248.","journal-title":"Management Science"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"2","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 2 (1956) 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin, \u201cComputer solution of the traveling salesman problem,\u201dBell System Technical Journal 44 (1965) 2245\u20132269.","journal-title":"Bell System Technical Journal"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"T. Motzkin","year":"1954","unstructured":"T. Motzkin and I.J. Schoenberg, \u201cThe relaxation method for linear inequalities,\u201dCanadian Journal of Mathematics 6 (1954) 393\u2013404.","journal-title":"Canadian Journal of Mathematics"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584070.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584070\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:29:27Z","timestamp":1556882967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,12]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1971,12]]}},"alternative-id":["BF01584070"],"URL":"https:\/\/doi.org\/10.1007\/bf01584070","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1971,12]]}}}