{"id":"https://openalex.org/W2062749672","doi":"https://doi.org/10.1137/0208045","title":"A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem","display_name":"A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem","publication_year":1979,"publication_date":"1979-11-01","ids":{"openalex":"https://openalex.org/W2062749672","doi":"https://doi.org/10.1137/0208045","mag":"2062749672"},"language":"en","primary_location":{"id":"doi:10.1137/0208045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0208045","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5068875104","display_name":"Richard M. Karp","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068875104"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.4566,"has_fulltext":false,"cited_by_count":175,"citation_normalized_percentile":{"value":0.97036224,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"8","issue":"4","first_page":"561","last_page":"573"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8869023323059082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6219028830528259},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.560306191444397},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5551577806472778},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5504577159881592},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.4891272187232971},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4691547155380249},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.4499264657497406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3534347414970398}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8869023323059082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6219028830528259},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.560306191444397},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5551577806472778},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5504577159881592},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.4891272187232971},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4691547155380249},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.4499264657497406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3534347414970398},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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":1,"locations":[{"id":"doi:10.1137/0208045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0208045","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2003351966","https://openalex.org/W2042587503","https://openalex.org/W2044060832","https://openalex.org/W2149342630","https://openalex.org/W2163318198","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W4200179302","https://openalex.org/W1595757466","https://openalex.org/W4389782626","https://openalex.org/W2766731260","https://openalex.org/W3210931532","https://openalex.org/W2620231896","https://openalex.org/W1645834615","https://openalex.org/W87675801","https://openalex.org/W2171568915","https://openalex.org/W2055574289"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,71,111],"algorithm":[3,33,62,106],"for":[4,39],"the":[5,9,36,40,46,49,61,66,78,95,98,101,105,108,133,142],"approximate":[6],"solution":[7],"of":[8,16,48,60,97,100,110,144],"nonsymmetric":[10],"n-city":[11],"traveling-salesman":[12],"problem.":[13,76],"An":[14],"instance":[15],"this":[17],"problem":[18,38],"is":[19,63,114,146],"specified":[20],"by":[21,104],"a":[22,55,86],"$n":[23,72,128],"\\times":[24,73],"n$":[25,74],"distance":[26],"matrix":[27,41],"$D":[28],"=":[29],"(d_{ij}":[30],")$.":[31],"The":[32,57],"first":[34],"solves":[35],"assignment":[37,51,75],"D,":[42],"and":[43],"then":[44],"patches":[45],"cycles":[47],"optimum":[50,112],"together":[52],"to":[53,65,69,93,107,125,136],"form":[54],"tour.":[56],"execution":[58],"time":[59,67],"comparable":[64],"required":[68],"solve":[70],"If":[77],"distances":[79],"$d_{ij}":[80],"$":[81,115],"are":[82],"drawn":[83],"independently":[84],"from":[85],"uniform":[87],"distribution":[88],"then,":[89],"with":[90],"probability":[91],"tending":[92],"1,":[94],"ratio":[96],"cost":[99,109],"tour":[102,113],"produced":[103],"<":[116],"1":[117],"+":[118],"\\varepsilon":[119],"(n)$,":[120],"where":[121],"$\\varepsilon":[122],"(n)$":[123],"goes":[124],"zero":[126],"as":[127],"\\to":[129],"\\infty":[130],"$.":[131],"Hence":[132],"method":[134],"tends":[135],"give":[137],"nearly":[138],"optimal":[139],"solutions":[140],"when":[141],"number":[143],"cities":[145],"extremely":[147],"large.":[148]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}