{"id":"https://openalex.org/W2086091870","doi":"https://doi.org/10.1137/0213007","title":"The Traveling Salesman Problem with Many Visits to Few Cities","display_name":"The Traveling Salesman Problem with Many Visits to Few Cities","publication_year":1984,"publication_date":"1984-02-01","ids":{"openalex":"https://openalex.org/W2086091870","doi":"https://doi.org/10.1137/0213007","mag":"2086091870"},"language":"en","primary_location":{"id":"doi:10.1137/0213007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213007","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/A5083516466","display_name":"Stavros S. Cosmadakis","orcid":"https://orcid.org/0000-0003-3345-9830"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stavros S. Cosmadakis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christos H. Papadimitriou","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083516466"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.25122449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"1","first_page":"99","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9987999796867371,"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.9096351861953735},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6306958198547363},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5944569706916809},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4899684488773346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4839668571949005},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47830870747566223},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.46999678015708923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44715356826782227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43921688199043274},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37321192026138306}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9096351861953735},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6306958198547363},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5944569706916809},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4899684488773346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4839668571949005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47830870747566223},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.46999678015708923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44715356826782227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43921688199043274},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37321192026138306},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":1,"locations":[{"id":"doi:10.1137/0213007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213007","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1969186119","https://openalex.org/W2041670460","https://openalex.org/W2042706779","https://openalex.org/W2044060832","https://openalex.org/W2062749672","https://openalex.org/W2069323107","https://openalex.org/W2076099212","https://openalex.org/W2125690626","https://openalex.org/W2144946856","https://openalex.org/W2149342630"],"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/W2362402143","https://openalex.org/W2033053473","https://openalex.org/W1991529799"],"abstract_inverted_index":{"We":[0,38],"study":[1],"the":[2,5,50,57,68,75],"version":[3],"of":[4,15,23,52,59,72,83,91],"traveling":[6],"salesman":[7],"problem":[8,44,69],"in":[9,56,74],"which":[10],"a":[11,20,64,89],"relatively":[12],"small":[13],"number":[14,22,51,58,90],"cities\u2014say,":[16],"six\u2014must":[17],"be":[18],"visited":[19],"huge":[21],"times\u2014e.g.,":[24],"several":[25],"hundred":[26],"times":[27],"each.":[28],"(It":[29],"costs":[30],"to":[31,36,67,88],"go":[32],"from":[33],"one":[34],"city":[35],"itself.)":[37],"develop":[39],"an":[40],"algorithm":[41,62,85],"for":[42,70],"this":[43],"whose":[45],"running":[46],"time":[47],"is":[48,63],"exponentialin":[49],"cities,":[53],"but":[54],"logarithmic":[55],"visits.":[60],"Our":[61],"practical":[65],"approach":[66],"instances":[71],"size":[73],"range":[76],"indicated":[77],"above.":[78],"The":[79],"implementation":[80],"and":[81,94],"analysis":[82],"our":[84],"give":[86],"rise":[87],"interesting":[92],"graph-theoretic":[93],"counting":[95],"problems.":[96]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-02-07T08:09:18.108334","created_date":"2025-10-10T00:00:00"}