{"id":"https://openalex.org/W7155373772","doi":"https://doi.org/10.48550/arxiv.2604.20109","title":"Learning to Solve the Quadratic Assignment Problem with Warm-Started MCMC Finetuning","display_name":"Learning to Solve the Quadratic Assignment Problem with Warm-Started MCMC Finetuning","publication_year":2026,"publication_date":"2026-04-22","ids":{"openalex":"https://openalex.org/W7155373772","doi":"https://doi.org/10.48550/arxiv.2604.20109"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.20109","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20109","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.20109","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014110043","display_name":"Yicheng Pan","orcid":"https://orcid.org/0000-0003-4918-3808"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pan, Yicheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134391248","display_name":"Ruisong Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Ruisong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134458053","display_name":"Haijun Zou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zou, Haijun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134425671","display_name":"Tianyou Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Tianyou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134409482","display_name":"Zaiwen Wen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wen, Zaiwen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5014110043"],"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.4350000023841858,"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.4350000023841858,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.11320000141859055,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.06509999930858612,"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/heuristics","display_name":"Heuristics","score":0.7623000144958496},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5921000242233276},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5785999894142151},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5199999809265137},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.4918000102043152},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.48829999566078186},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.47609999775886536},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.45890000462532043},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.3982999920845032}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7623000144958496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7494999766349792},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5921000242233276},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5785999894142151},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5199999809265137},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.4918000102043152},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.48829999566078186},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.47609999775886536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4652999937534332},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.45890000462532043},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.3982999920845032},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3946000039577484},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.392300009727478},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.35920000076293945},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.31369999051094055},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.3091000020503998},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2581999897956848},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.20109","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20109","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.20109","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20109","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.636590838432312}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"quadratic":[1],"assignment":[2],"problem":[3],"(QAP)":[4],"is":[5],"a":[6,110,143],"fundamental":[7],"NP-hard":[8],"task":[9],"that":[10,92,130],"poses":[11],"significant":[12],"challenges":[13],"for":[14],"both":[15],"traditional":[16],"heuristics":[17],"and":[18,112,122,160],"modern":[19],"learning-based":[20],"solvers.":[21],"Existing":[22],"QAP":[23,166],"solvers":[24],"still":[25],"struggle":[26],"to":[27,58,66,70,105,117],"achieve":[28],"consistently":[29,132],"competitive":[30],"performance":[31,40],"across":[32,136],"structurally":[33],"diverse":[34],"real-world":[35],"instances.":[36],"To":[37],"bridge":[38],"this":[39],"gap,":[41],"we":[42,85],"propose":[43],"PLMA,":[44],"an":[45,52,87,94,164],"innovative":[46],"permutation":[47,83],"learning":[48],"framework.":[49],"PLMA":[50,131,141],"features":[51],"efficient":[53],"warm-started":[54],"MCMC":[55,80],"finetuning":[56],"procedure":[57],"enhance":[59],"deployment-time":[60],"performance,":[61],"leveraging":[62],"short":[63],"Markov":[64],"chains":[65],"anchor":[67],"the":[68,71,82,101,107,125,155],"adaptation":[69],"promising":[72],"regions":[73],"previously":[74],"explored.":[75],"For":[76],"rapid":[77],"exploration":[78],"via":[79],"over":[81],"space,":[84],"design":[86],"additive":[88],"energy-based":[89],"model":[90,118],"(EBM)":[91],"enables":[93],"$O(1)$-time":[95],"2-swap":[96],"Metropolis-Hastings":[97],"sampling":[98],"step.":[99],"Moreover,":[100],"neural":[102],"network":[103],"used":[104],"parameterize":[106],"EBM":[108],"incorporates":[109],"scalable":[111],"flexible":[113],"cross-graph":[114],"attention":[115],"mechanism":[116],"interactions":[119],"between":[120],"facilities":[121],"locations":[123],"in":[124,168],"QAP.":[126],"Extensive":[127],"experiments":[128],"demonstrate":[129],"outperforms":[133],"state-of-the-art":[134],"baselines":[135],"various":[137],"benchmarks.":[138],"In":[139],"particular,":[140],"achieves":[142],"near-zero":[144],"average":[145],"optimality":[146],"gap":[147],"on":[148,154],"QAPLIB,":[149],"exhibits":[150],"remarkably":[151],"superior":[152],"robustness":[153],"notoriously":[156],"difficult":[157],"Taixxeyy":[158],"instances,":[159],"also":[161],"serves":[162],"as":[163],"effective":[165],"solver":[167],"bandwidth":[169],"minimization.":[170]},"counts_by_year":[],"updated_date":"2026-04-24T06:07:52.864757","created_date":"2026-04-24T00:00:00"}