{"id":"https://openalex.org/W2035610952","doi":"https://doi.org/10.1002/net.3230120103","title":"On the worst\u2010case performance of some algorithms for the asymmetric traveling salesman problem","display_name":"On the worst\u2010case performance of some algorithms for the asymmetric traveling salesman problem","publication_year":1982,"publication_date":"1982-03-01","ids":{"openalex":"https://openalex.org/W2035610952","doi":"https://doi.org/10.1002/net.3230120103","mag":"2035610952"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230120103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230120103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]},{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]},{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. M. Frieze","raw_affiliation_strings":["Department of Computer Science and Statistics, Queen Mary College, London University, London, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Statistics, Queen Mary College, London University, London, England","institution_ids":["https://openalex.org/I124357947","https://openalex.org/I166337079","https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012585989","display_name":"Giulia Galbiati","orcid":null},"institutions":[{"id":"https://openalex.org/I25217355","display_name":"University of Pavia","ror":"https://ror.org/00s6t1f81","country_code":"IT","type":"education","lineage":["https://openalex.org/I25217355"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Galbiati","raw_affiliation_strings":["Istituto di Matematica, Universita di Pavia, 27100 Pavia, Italy","Istituto di Matematica, Universit\u00e0 di Pavia, 27100 Pavia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto di Matematica, Universita di Pavia, 27100 Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]},{"raw_affiliation_string":"Istituto di Matematica, Universit\u00e0 di Pavia, 27100 Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053677027","display_name":"Francesco Maffioli","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Maffioli","raw_affiliation_strings":["Istituto di Elettrotecnica ed Elettronica & Centro Telecommunicazioni Spazioli of CNR, Politecnico di Milano, 20133, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto di Elettrotecnica ed Elettronica & Centro Telecommunicazioni Spazioli of CNR, Politecnico di Milano, 20133, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.5879,"has_fulltext":false,"cited_by_count":254,"citation_normalized_percentile":{"value":0.83283804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"12","issue":"1","first_page":"23","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9390914440155029},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8408360481262207},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6500592827796936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5052428841590881},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48763957619667053},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.447714239358902},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42288142442703247},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.42185649275779724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42147067189216614},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4127645492553711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3851291537284851}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9390914440155029},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8408360481262207},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6500592827796936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5052428841590881},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48763957619667053},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.447714239358902},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42288142442703247},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.42185649275779724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42147067189216614},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4127645492553711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3851291537284851},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230120103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230120103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W60525624","https://openalex.org/W1599161138","https://openalex.org/W1968766664","https://openalex.org/W1988062309","https://openalex.org/W1991528957","https://openalex.org/W2006060626","https://openalex.org/W2011039300","https://openalex.org/W2018994930","https://openalex.org/W2036265926","https://openalex.org/W2042986967","https://openalex.org/W2056898464","https://openalex.org/W2065124181","https://openalex.org/W2084243923","https://openalex.org/W2086917808","https://openalex.org/W2089929819","https://openalex.org/W2111581650","https://openalex.org/W2117226423","https://openalex.org/W2148673189","https://openalex.org/W2172285784","https://openalex.org/W2401610261","https://openalex.org/W4255529553"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2359992618","https://openalex.org/W2265604726","https://openalex.org/W2171568915","https://openalex.org/W2033053473","https://openalex.org/W2362402143","https://openalex.org/W2170228269"],"abstract_inverted_index":{"Abstract":[0],"We":[1,44],"consider":[2],"the":[3,10,24],"asymmetric":[4],"traveling":[5],"salesman":[6],"problem":[7],"for":[8,40],"which":[9],"triangular":[11],"inequality":[12],"is":[13,36],"satisfied.":[14],"For":[15],"various":[16],"heuristics":[17],"we":[18],"construct":[19],"examples":[20],"to":[21,32],"show":[22],"that":[23],"worst\u2010case":[25],"ratio":[26],"of":[27,29],"length":[28,34],"tour":[30,35],"found":[31],"minimum":[33],"(":[37],"n":[38,41,52],")":[39],"city":[42],"problems.":[43],"also":[45],"provide":[46],"a":[47],"new":[48],"O":[49],"([log":[50],"2":[51],"])":[53],"heuristic.":[54]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}