{"id":"https://openalex.org/W7140300126","doi":"https://doi.org/10.48550/arxiv.2603.23290","title":"Traveling Salesman Problem with a preprocessing method for classical and quantum optimization","display_name":"Traveling Salesman Problem with a preprocessing method for classical and quantum optimization","publication_year":2026,"publication_date":"2026-03-24","ids":{"openalex":"https://openalex.org/W7140300126","doi":"https://doi.org/10.48550/arxiv.2603.23290"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.23290","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23290","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.23290","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116416683","display_name":"Alessia Ciacco","orcid":"https://orcid.org/0009-0002-4840-3135"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ciacco, Alessia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010455422","display_name":"Luigi Di Puglia Pugliese","orcid":"https://orcid.org/0000-0002-6895-1457"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pugliese, Luigi Di Puglia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081616385","display_name":"Francesca Guerriero","orcid":"https://orcid.org/0000-0002-3887-1317"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guerriero, Francesca","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.27639999985694885,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.27639999985694885,"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"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.1996999979019165,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.09889999777078629,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7973999977111816},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6022999882698059},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5601000189781189},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5425999760627747},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5056999921798706},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.49000000953674316},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47029998898506165},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.400299996137619},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.3953999876976013}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7973999977111816},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6723999977111816},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6022999882698059},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5601000189781189},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5425999760627747},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5056999921798706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5001000165939331},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.49000000953674316},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47029998898506165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4189999997615814},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.400299996137619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3978999853134155},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.3953999876976013},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3531000018119812},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.33629998564720154},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.33009999990463257},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3059999942779541},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.2655999958515167},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2606000006198883},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.2565000057220459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.23290","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23290","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.23290","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23290","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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,91],"Traveling":[1],"Salesman":[2],"Problem":[3],"is":[4,93],"a":[5,45],"fundamental":[6],"combinatorial":[7],"optimization":[8,55,100,138],"problem":[9],"widely":[10],"studied":[11],"in":[12,104,109],"operations":[13],"research.":[14],"Despite":[15],"its":[16],"simple":[17],"formulation,":[18],"it":[19],"remains":[20],"computationally":[21],"challenging":[22],"due":[23],"to":[24,39],"the":[25,29,33,51,54,59,67,81,86,113,117,121,124],"exponential":[26],"growth":[27],"of":[28,36,53,61,88,123],"search":[30],"space":[31],"and":[32,64,98,107,126,135],"large":[34],"number":[35,87],"constraints":[37],"required":[38],"eliminate":[40],"subtours.":[41],"This":[42],"paper":[43],"introduces":[44],"preprocessing":[46,119],"strategy":[47],"that":[48,80,116],"significantly":[49],"reduces":[50,85],"size":[52],"model":[56],"by":[57],"restricting":[58],"set":[60],"candidate":[62],"arcs":[63],"retaining":[65],"only":[66],"lowest-cost":[68],"neighbors":[69],"for":[70,131],"each":[71],"vertex.":[72],"Computational":[73],"experiments":[74],"on":[75],"TSPLIB":[76],"benchmark":[77],"instances":[78],"demonstrate":[79],"proposed":[82,118],"approach":[83],"substantially":[84],"decision":[89],"variables.":[90],"method":[92],"evaluated":[94],"using":[95],"both":[96,132],"classical":[97,133],"quantum":[99,137],"techniques,":[101],"showing":[102],"improvements":[103],"computational":[105],"time":[106],"reductions":[108],"optimality":[110],"gaps.":[111],"Overall,":[112],"results":[114],"indicate":[115],"enhances":[120],"scalability":[122],"formulations":[125],"makes":[127],"them":[128],"more":[129],"suitable":[130],"solvers":[134],"emerging":[136],"frameworks.":[139]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-26T00:00:00"}