{"id":"https://openalex.org/W3012011993","doi":"https://doi.org/10.1109/cdc40024.2019.9030031","title":"A Submodular Optimization Approach to the Metric Traveling Salesman Problem with Neighborhoods","display_name":"A Submodular Optimization Approach to the Metric Traveling Salesman Problem with Neighborhoods","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3012011993","doi":"https://doi.org/10.1109/cdc40024.2019.9030031","mag":"3012011993"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9030031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9030031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-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/A5004774385","display_name":"Andrew Clark","orcid":"https://orcid.org/0000-0002-5868-6186"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew Clark","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, USA","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004774385"],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.23367327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3383","last_page":"3390"},"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.9994000196456909,"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.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/submodular-set-function","display_name":"Submodular set function","score":0.9356116056442261},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9074199199676514},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6380777955055237},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5692892074584961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5654506087303162},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4661496877670288},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.44206202030181885},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.4370438754558563},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43434202671051025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2961592376232147},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.13925105333328247},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11557424068450928}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9356116056442261},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9074199199676514},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6380777955055237},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5692892074584961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5654506087303162},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4661496877670288},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.44206202030181885},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.4370438754558563},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43434202671051025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2961592376232147},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.13925105333328247},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11557424068450928},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc40024.2019.9030031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9030031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1480355964","https://openalex.org/W1517470327","https://openalex.org/W1517890525","https://openalex.org/W1524136787","https://openalex.org/W1680189815","https://openalex.org/W1870153077","https://openalex.org/W1935379866","https://openalex.org/W2009803313","https://openalex.org/W2035610952","https://openalex.org/W2036493899","https://openalex.org/W2054575839","https://openalex.org/W2091682553","https://openalex.org/W2110824994","https://openalex.org/W2117226423","https://openalex.org/W2165142526","https://openalex.org/W2240814884","https://openalex.org/W2401610261","https://openalex.org/W2606868416","https://openalex.org/W2781784381","https://openalex.org/W2796815965","https://openalex.org/W3121675905","https://openalex.org/W4246219036","https://openalex.org/W4294358747","https://openalex.org/W6631208778","https://openalex.org/W6663968304","https://openalex.org/W6677426919"],"related_works":["https://openalex.org/W2378749191","https://openalex.org/W3124239341","https://openalex.org/W4200602616","https://openalex.org/W3164942530","https://openalex.org/W4224271060","https://openalex.org/W2049828308","https://openalex.org/W2735287957","https://openalex.org/W4303859869","https://openalex.org/W2056268894","https://openalex.org/W2111852497"],"abstract_inverted_index":{"The":[0],"Traveling":[1,13],"Salesman":[2,14],"Problem":[3,15],"with":[4,85],"Neighborhoods":[5],"(TSPN)":[6],"is":[7,45,78,96],"a":[8,20,25,46,67,82,86,98,108,116,127],"generalization":[9],"of":[10,18,27,100,102,111],"the":[11,33,37,42,56,59,76,93,103,112,120],"classic":[12],"that":[16,23,75,92,114,131],"consists":[17],"finding":[19],"minimum-length":[21],"path":[22],"reaches":[24],"set":[26],"regions":[28],"and":[29,48,61],"then":[30],"returns":[31],"to":[32,65,80],"origin.":[34],"We":[35,90,138],"consider":[36],"metric":[38],"TSPN,":[39],"in":[40,71],"which":[41,72],"length":[43],"function":[44,84],"metric,":[47],"develop":[49,66,107],"two":[50],"approximation":[51],"algorithms.":[52],"First,":[53],"we":[54,73,106],"exploit":[55],"connection":[57],"between":[58],"TSP":[60],"minimum":[62],"spanning":[63,87],"trees":[64],"submodular":[68,83],"optimization":[69],"approach,":[70],"show":[74],"TSPN":[77],"equivalent":[79],"maximizing":[81],"tree":[88],"constraint.":[89],"prove":[91],"resulting":[94],"tour":[95,122],"within":[97],"factor":[99],"4":[101],"optimum.":[104],"Second,":[105],"convex":[109],"relaxation":[110],"problem":[113],"gives":[115,132],"lower":[117],"bound":[118],"on":[119],"optimal":[121],"length,":[123],"as":[124,126],"well":[125],"straightforward":[128],"rounding":[129],"procedure":[130],"an":[133],"alternative":[134],"heuristic":[135],"for":[136],"TSPN.":[137],"evaluate":[139],"our":[140],"approaches":[141],"through":[142],"numerical":[143],"study.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}