{"id":"https://openalex.org/W7118308486","doi":"https://doi.org/10.1137/1.9781611978971.208","title":"A Near-Complete Resolution of the Exponential-Time Complexity of \\(k\\)-opt for the Traveling Salesman Problem","display_name":"A Near-Complete Resolution of the Exponential-Time Complexity of \\(k\\)-opt for the Traveling Salesman Problem","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118308486","doi":"https://doi.org/10.1137/1.9781611978971.208"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.208","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.208","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"conference-paper","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/A5113118782","display_name":"Sophia Heimann","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sophia Heimann","raw_affiliation_strings":["University of Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086971499","display_name":"Hung P. Hoang","orcid":"https://orcid.org/0000-0001-7883-4134"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hung P. Hoang","raw_affiliation_strings":["Faculty of Informatics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Informatics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085228445","display_name":"Stefan Hougardy","orcid":"https://orcid.org/0000-0001-8656-3418"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Hougardy","raw_affiliation_strings":["University of Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0781074,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5861","last_page":"5885"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5468000173568726,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5468000173568726,"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.18880000710487366,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.1850000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8489000201225281},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6256999969482422},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5616000294685364},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4869999885559082},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4851999878883362},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.45980000495910645},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.45750001072883606},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.45399999618530273},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.41600000858306885}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8489000201225281},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6256999969482422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6096000075340271},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5616000294685364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5494999885559082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4884999990463257},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4869999885559082},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4851999878883362},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.45980000495910645},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.45750001072883606},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.45399999618530273},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.41600000858306885},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3889999985694885},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.37400001287460327},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.33489999175071716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3312999904155731},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.3208000063896179},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.208","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.208","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,40],"\\(k\\)-opt":[1,25,65,150],"algorithm":[2,26,41,66,151],"is":[3,50,120,178],"one":[4],"of":[5,47,72,77,109,147,182],"the":[6,15,24,28,64,75,90,145,149,169,190,193],"simplest":[7],"and":[8,95,130,177,192],"most":[9],"widely":[10],"used":[11],"heuristics":[12],"for":[13,69,89,139,168,188],"solving":[14],"traveling":[16,195],"salesman":[17,196],"problem.":[18,197],"Starting":[19],"from":[20],"an":[21,58,78,106,116,155,163],"arbitrary":[22],"tour,":[23],"improves":[27],"current":[29],"tour":[30],"in":[31,102],"each":[32],"iteration":[33],"by":[34,99,127],"exchanging":[35],"up":[36],"to":[37],"\\(k\\)":[38],"edges.":[39],"continues":[42],"until":[43],"no":[44],"further":[45],"improvement":[46],"this":[48,83,87,134],"kind":[49],"possible.":[51],"For":[52],"a":[53,124,136,172,179],"long":[54],"time,":[55],"it":[56],"remained":[57],"open":[59],"question":[60,88],"how":[61],"many":[62],"iterations":[63,110,148],"might":[67],"require":[68,153],"small":[70],"values":[71],"\\(k\\),":[73],"assuming":[74],"use":[76],"optimal":[79,117,156],"pivot":[80,118,157],"rule.":[81,158],"In":[82,159],"paper,":[84],"we":[85,161],"resolve":[86],"cases":[91,105],"\\(k":[92,96,141],"=":[93,97],"3\\)":[94,143],"4\\)":[98],"proving":[100],"that":[101,174],"both":[103,189],"these":[104],"exponential":[107,165],"number":[108,146],"may":[111,152],"be":[112],"needed":[113],"even":[114],"if":[115],"rule":[119],"used.":[121],"Combined":[122],"with":[123],"recent":[125],"result":[126],"Heimann,":[128],"Hoang,":[129],"Hougardy":[131],"(ICALP":[132],"2024),":[133],"provides":[135],"complete":[137],"answer":[138],"all":[140],"\\ge":[142],"regarding":[144],"under":[154],"addition":[160],"establish":[162],"analogous":[164],"lower":[166],"bound":[167],"2.5-opt":[170],"algorithm,":[171],"variant":[173],"generalizes":[175],"2-opt":[176],"restricted":[180],"version":[181],"3-opt.":[183],"All":[184],"our":[185],"results":[186],"hold":[187],"general":[191],"metric":[194]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-01-08T00:00:00"}