{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T12:07:16Z","timestamp":1743336436147},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"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":[[1974,12]]},"DOI":"10.1007\/bf01585505","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:09:11Z","timestamp":1114664951000},"page":"87-96","source":"Crossref","is-referenced-by-count":58,"title":["Improvements of the Held\u2014Karp algorithm for the symmetric traveling-salesman problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Keld","family":"Helbig Hansen","sequence":"first","affiliation":[]},{"given":"Jakob","family":"Krarup","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","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\u201d,Numerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1145\/362790.362803","volume":"13","author":"M.H. Emden van","year":"1970","unstructured":"M.H. van Emden, \u201cIncreasing the efficiency of quicksort\u201d, Algorithm 402,Communications of the Association for Computing Machinery 13 (1970) 693\u2013695.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"CR3","volume-title":"Sekvensproblemer med vaegt p\u00e5 modifikation af Held og Karp's algoritme","author":"K. Helbig Hansen","year":"1971","unstructured":"K. Helbig Hansen, \u201cSekvensproblemer med vaegt p\u00e5 modifikation af Held og Karp's algoritme\u201d, M.Sc. thesis, Institute of Datalogy, University of Copenhagen, Denmark (1971)."},{"key":"CR4","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\u201d,Operations Research 18 (1970) 1138\u20131162.","journal-title":"Operations Research"},{"key":"CR5","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\u201d,Mathematical Programming 1 (1971) 6\u201325.","journal-title":"Mathematical Programming"},{"key":"CR6","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\u201d,Proceedings of the American Mathematical Society 2 (1956) 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim, \u201cShortest connection networks and some generalizations\u201d,Bell System Technical Journal 36 (1957) 1389\u20131401.","journal-title":"Bell System Technical Journal"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585505.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585505\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:28Z","timestamp":1556883148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["BF01585505"],"URL":"https:\/\/doi.org\/10.1007\/bf01585505","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}