{"id":"https://openalex.org/W6891564556","doi":"https://doi.org/10.4230/lipics.cp.2025.30","title":"Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs","display_name":"Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6891564556","doi":"https://doi.org/10.4230/lipics.cp.2025.30"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23891","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.30/LIPIcs.CP.2025.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.30/LIPIcs.CP.2025.30.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pekar, Daniel","orcid":"https://orcid.org/0009-0008-6281-935X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Pekar, Daniel","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Toronto, Canada"],"raw_orcid":"https://orcid.org/0009-0008-6281-935X","affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":null,"display_name":"Beck, J. Christopher","orcid":"https://orcid.org/0000-0002-4656-8908"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Beck, J. Christopher","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Toronto, Canada"],"raw_orcid":"https://orcid.org/0000-0002-4656-8908","affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.5141549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.791100025177002,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.791100025177002,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0674000009894371,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.01600000075995922,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/vertex","display_name":"Vertex (graph theory)","score":0.5580999851226807},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5170000195503235},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.46470001339912415},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45489999651908875},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45239999890327454},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4171000123023987},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.41449999809265137},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41429999470710754}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5580999851226807},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4684999883174896},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4528000056743622},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45239999890327454},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4171000123023987},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.41449999809265137},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41429999470710754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3885999917984009},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3846000134944916},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.35589998960494995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34779998660087585},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.3174999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3100000023841858},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29249998927116394},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.27950000762939453},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.2784000039100647},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23891","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.30/LIPIcs.CP.2025.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.cp.2025.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cp.2025.30","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23891","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.30/LIPIcs.CP.2025.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320312716","display_name":"Innovation, Science and Economic Development Canada","ror":"https://ror.org/03zp01h17"},{"id":"https://openalex.org/F4320322015","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087"},{"id":"https://openalex.org/F4320331257","display_name":"Alliance de recherche num\u00e9rique du Canada","ror":"https://ror.org/010r6td27"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6891564556.pdf","grobid_xml":"https://content.openalex.org/works/W6891564556.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Finding":[0],"the":[1,19,44,52,62,69,78,131,152,155,168,176,181,184],"minimal-cost":[2],"closed":[3],"loop":[4],"on":[5,68,81,144,187,208],"a":[6,25,35,39,65,82,88,140],"weighted":[7],"graph":[8],"where":[9,91],"every":[10],"vertex":[11,36,55,92,135],"is":[12,16,160,170,180],"visited":[13],"exactly":[14],"once":[15],"known":[17],"as":[18],"Travelling":[20],"Salesperson":[21],"Problem":[22],"(TSP).":[23],"In":[24],"recently":[26],"proposed":[27],"variant,":[28],"TSP":[29],"with":[30],"Self-Deleting":[31],"graphs":[32],"(TSP-SD),":[33],"visiting":[34],"i":[37],"deletes":[38],"set":[40],"of":[41,64,183,205],"edges":[42,95],"in":[43,60,77,203],"graph,":[45],"preventing":[46],"their":[47],"subsequent":[48],"traversal.":[49],"Due":[50],"to":[51,86,120],"dependency":[53],"between":[54,154],"visits":[56,93],"and":[57,114,157,164,191,198],"edge":[58],"deletion,":[59],"TSP-SD":[61],"feasibility":[63],"cycle":[66],"depends":[67],"start":[70],"node.":[71],"The":[72],"best":[73,182],"performing":[74],"solution":[75,206],"approaches":[76],"literature":[79],"rely":[80],"simple":[83,126],"problem":[84],"reformulation":[85,169],"find":[87],"backward":[89],"tour":[90],"add":[94],"rather":[96],"than":[97],"delete":[98],"them.":[99],"This":[100],"paper":[101],"investigates":[102],"exact":[103,185],"model-based":[104],"approaches,":[105],"specifically":[106],"Constraint":[107],"Programming":[108,112,118],"(CP),":[109],"Domain-Independent":[110],"Dynamic":[111],"(DIDP),":[113],"Mixed":[115],"Integer":[116],"Linear":[117],"(MIP)":[119],"solve":[121],"TSP-SD.":[122],"We":[123],"show":[124],"that":[125,151,167],"preprocessing":[127],"can":[128],"substantially":[129],"reduce":[130],"options":[132],"for":[133,162,172,196],"start/end":[134],"pairs":[136],"but":[137,166],"typically":[138],"has":[139],"limited":[141],"positive":[142],"impact":[143],"search":[145],"performance.":[146,174],"Our":[147],"numerical":[148],"results":[149],"demonstrate":[150],"difference":[153],"deletion":[156],"addition":[158,178],"variants":[159],"small":[161,197],"CP":[163],"MIP":[165],"critical":[171],"DIDP":[173,177],"Overall,":[175],"model":[179],"methods":[186],"all":[188],"test":[189],"instances":[190,200],"outperforms":[192],"existing":[193],"heuristic":[194],"solvers":[195],"medium-sized":[199],"while":[201],"trailing":[202],"terms":[204],"quality":[207],"larger":[209],"instances.":[210]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}