{"id":"https://openalex.org/W2117226423","doi":"https://doi.org/10.1007/s43069-021-00101-z","title":"Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem","display_name":"Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem","publication_year":2022,"publication_date":"2022-03-01","ids":{"openalex":"https://openalex.org/W2117226423","doi":"https://doi.org/10.1007/s43069-021-00101-z","mag":"2117226423"},"language":"en","primary_location":{"id":"doi:10.1007/s43069-021-00101-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s43069-021-00101-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s43069-021-00101-z.pdf","source":{"id":"https://openalex.org/S4210215153","display_name":"Operations Research Forum","issn_l":"2662-2556","issn":["2662-2556"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Forum","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s43069-021-00101-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111519836","display_name":"Nicos Christofides","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nicos Christofides","raw_affiliation_strings":["Management Science Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 15213, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Management Science Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 15213, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111519836"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2780,"currency":"USD","value_usd":2780},"apc_paid":{"value":2780,"currency":"USD","value_usd":2780},"fwci":24.4469,"has_fulltext":true,"cited_by_count":1146,"citation_normalized_percentile":{"value":0.99734598,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"3","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9350293874740601},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6486165523529053},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5966814756393433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5891820788383484},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49865269660949707},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4985086917877197},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4898357093334198},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4521576762199402},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4496333599090576},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4333125352859497},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42056217789649963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32723376154899597},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2915935516357422}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9350293874740601},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6486165523529053},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5966814756393433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5891820788383484},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49865269660949707},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4985086917877197},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4898357093334198},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4521576762199402},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4496333599090576},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4333125352859497},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42056217789649963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32723376154899597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2915935516357422},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s43069-021-00101-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s43069-021-00101-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s43069-021-00101-z.pdf","source":{"id":"https://openalex.org/S4210215153","display_name":"Operations Research Forum","issn_l":"2662-2556","issn":["2662-2556"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Forum","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:snopef:v:3:y:2022:i:1:d:10.1007_s43069-021-00101-z","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s43069-021-00101-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s43069-021-00101-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s43069-021-00101-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s43069-021-00101-z.pdf","source":{"id":"https://openalex.org/S4210215153","display_name":"Operations Research Forum","issn_l":"2662-2556","issn":["2662-2556"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Forum","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6600000262260437,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2117226423.pdf","grobid_xml":"https://content.openalex.org/works/W2117226423.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2016493933","https://openalex.org/W2025904765","https://openalex.org/W2043862089","https://openalex.org/W2084243923","https://openalex.org/W2125554210"],"related_works":["https://openalex.org/W2140318223","https://openalex.org/W2125152887","https://openalex.org/W4384346360","https://openalex.org/W4320488299","https://openalex.org/W1868361628","https://openalex.org/W2788398742","https://openalex.org/W2044294126","https://openalex.org/W1997470528","https://openalex.org/W2513094291","https://openalex.org/W1971327934"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"O(":[2],"n":[3],"3":[4],")":[5],"heuristic":[6,66],"algorithm":[7,26],"is":[8,80],"described":[9],"for":[10,102,110],"solving":[11],"d":[12],"-city":[13],"travelling":[14],"salesman":[15],"problems":[16],"(TSP)":[17],"whose":[18],"cost":[19,50],"matrix":[20],"satisfies":[21],"the":[22,30,38,42,45,69,72,76,91,96,103,111],"triangularity":[23],"condition.":[24],"The":[25],"involves":[27],"as":[28],"substeps":[29],"computation":[31],"of":[32,37,47,53,58,64,71,105],"a":[33,48,54,87],"shortest":[34],"spanning":[35],"tree":[36],"graph":[39],"G":[40,59],"defining":[41],"TSP":[43,78],"and":[44],"finding":[46],"minimum":[49],"perfect":[51],"matching":[52],"certain":[55],"induced":[56],"subgraph":[57],".":[60],"A":[61],"worst-case":[62],"analysis":[63],"this":[65],"shows":[67],"that":[68],"ratio":[70,101],"answer":[73],"obtained":[74],"to":[75],"optimum":[77],"solution":[79],"strictly":[81],"less":[82],"than":[83],"3/2.":[84],"This":[85],"represents":[86],"50%":[88],"reduction":[89],"over":[90],"value":[92],"2":[93],"which":[94],"was":[95],"previously":[97],"best":[98],"known":[99],"such":[100],"performance":[104],"other":[106],"polynomial":[107],"growth":[108],"algorithms":[109],"TSP.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":17},{"year":2025,"cited_by_count":38},{"year":2024,"cited_by_count":60},{"year":2023,"cited_by_count":47},{"year":2022,"cited_by_count":39},{"year":2021,"cited_by_count":73},{"year":2020,"cited_by_count":81},{"year":2019,"cited_by_count":69},{"year":2018,"cited_by_count":61},{"year":2017,"cited_by_count":55},{"year":2016,"cited_by_count":63},{"year":2015,"cited_by_count":52},{"year":2014,"cited_by_count":68},{"year":2013,"cited_by_count":48},{"year":2012,"cited_by_count":45}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}