{"id":"https://openalex.org/W2058748455","doi":"https://doi.org/10.1007/bf01584070","title":"The traveling-salesman problem and minimum spanning trees: Part II","display_name":"The traveling-salesman problem and minimum spanning trees: Part II","publication_year":1971,"publication_date":"1971-12-01","ids":{"openalex":"https://openalex.org/W2058748455","doi":"https://doi.org/10.1007/bf01584070","mag":"2058748455"},"language":"en","primary_location":{"id":"doi:10.1007/bf01584070","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01584070","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072339215","display_name":"Michael Held","orcid":"https://orcid.org/0000-0003-2604-8048"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Held","raw_affiliation_strings":["IBM Systems Research Institute New York, New York, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Systems Research Institute New York, New York, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068875104","display_name":"Richard M. Karp","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":["University of California, Berkeley, California, USA","University of California\u2010Berkeley USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, California, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California\u2010Berkeley USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":40.8417,"has_fulltext":false,"cited_by_count":1017,"citation_normalized_percentile":{"value":0.99860724,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"1","issue":"1","first_page":"6","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9380991458892822},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.753545880317688},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7267684936523438},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6751363277435303},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6282780170440674},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5934811234474182},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5477834939956665},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5147373676300049},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5077446699142456},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.499065637588501},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4915703237056732},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4654923677444458},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4177965819835663}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9380991458892822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.753545880317688},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7267684936523438},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6751363277435303},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6282780170440674},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5934811234474182},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5477834939956665},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5147373676300049},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5077446699142456},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.499065637588501},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4915703237056732},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4654923677444458},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4177965819835663},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01584070","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01584070","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1969186119","https://openalex.org/W2009803313","https://openalex.org/W2037455079","https://openalex.org/W2056898464","https://openalex.org/W2058937865","https://openalex.org/W2106378689","https://openalex.org/W2136499036","https://openalex.org/W2148673189","https://openalex.org/W2169528473","https://openalex.org/W2321466613","https://openalex.org/W2329579984","https://openalex.org/W2399100674","https://openalex.org/W3118260104"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2362402143","https://openalex.org/W1984036937","https://openalex.org/W2171568915","https://openalex.org/W2265604726","https://openalex.org/W8433631"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":22},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":31},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":25},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":27},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":34}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}