{"id":"https://openalex.org/W7140226253","doi":"https://doi.org/10.48550/arxiv.2603.20801","title":"Large Neighborhood Search meets Iterative Neural Constraint Heuristics","display_name":"Large Neighborhood Search meets Iterative Neural Constraint Heuristics","publication_year":2026,"publication_date":"2026-03-21","ids":{"openalex":"https://openalex.org/W7140226253","doi":"https://doi.org/10.48550/arxiv.2603.20801"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.20801","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.20801","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.20801","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Xu, Yudong W.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Yudong W.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Li, Wenhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Wenhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sanner, Scott","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanner, Scott","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Khalil, Elias B.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khalil, Elias B.","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.4943000078201294,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.4943000078201294,"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/T12176","display_name":"Optimization and Packing Problems","score":0.019600000232458115,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.01810000091791153,"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/heuristics","display_name":"Heuristics","score":0.7669000029563904},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.6211000084877014},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5333999991416931},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49559998512268066},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4390000104904175},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4221999943256378},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.40689998865127563},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4066999852657318}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7669000029563904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6341999769210815},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.6211000084877014},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5333999991416931},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5332000255584717},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49559998512268066},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4413999915122986},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.40689998865127563},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4066999852657318},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3560999929904938},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.328900009393692},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C86582703","wikidata":"https://www.wikidata.org/wiki/Q7617824","display_name":"Stochastic neural network","level":4,"score":0.2939000129699707},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C526921623","wikidata":"https://www.wikidata.org/wiki/Q190117","display_name":"Automotive industry","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2777000069618225},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2554999887943268},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.20801","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.20801","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.20801","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.20801","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.449493408203125}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Neural":[0],"networks":[1],"are":[2,14],"being":[3],"increasingly":[4],"used":[5],"as":[6,97,189],"heuristics":[7,35,75],"for":[8,178,196],"constraint":[9,46],"satisfaction.":[10],"These":[11,185],"neural":[12,34,45,56,99,133,153,201],"methods":[13],"often":[15],"recurrent,":[16],"learning":[17],"to":[18,87,108,135],"iteratively":[19],"refine":[20],"candidate":[21],"assignments.":[22,117],"In":[23],"this":[24],"work,":[25],"we":[26,71,94,128],"make":[27],"explicit":[28],"the":[29,54,62,68,83,91,104,114,132],"connection":[30],"between":[31],"such":[32],"iterative":[33,200],"and":[36,41,64,76,102,126,146,152,193,198],"Large":[37],"Neighborhood":[38],"Search":[39],"(LNS),":[40],"adapt":[42],"an":[43,49,119,136],"existing":[44],"satisfaction":[47],"method-ConsFormer-into":[48],"LNS":[50,57,137,188],"procedure.":[51],"We":[52,155],"decompose":[53],"resulting":[55],"into":[58],"two":[59],"standard":[60],"components:":[61],"destroy":[63,69,164],"repair":[65,92,100,171,177],"operators.":[66],"On":[67,90],"side,":[70,93],"instantiate":[72],"several":[73],"classical":[74,151],"introduce":[77],"novel":[78],"prediction-guided":[79],"operators":[80,165],"that":[81,112,130],"exploit":[82],"model's":[84],"internal":[85],"scores":[86],"select":[88],"neighborhoods.":[89],"utilize":[95],"ConsFormer":[96],"a":[98,109,180,190],"operator":[101],"compare":[103],"original":[105],"sampling-based":[106,176],"decoder":[107,111],"greedy":[110,167,170],"selects":[113],"most":[115],"likely":[116],"Through":[118],"empirical":[120],"study":[121],"on":[122],"Sudoku,":[123],"Graph":[124],"Coloring,":[125],"MaxCut,":[127],"find":[129],"adapting":[131],"heuristic":[134],"procedure":[138],"yields":[139],"substantial":[140],"gains":[141],"over":[142],"its":[143,148],"vanilla":[144],"settings":[145],"improves":[147],"competitiveness":[149],"with":[150],"baselines.":[154],"further":[156],"observe":[157],"consistent":[158],"design":[159,194],"patterns":[160],"across":[161],"tasks:":[162],"stochastic":[163],"outperform":[166],"ones,":[168],"while":[169],"is":[172],"more":[173],"effective":[174],"than":[175],"finding":[179],"single":[181],"high-quality":[182],"feasible":[183],"assignment.":[184],"findings":[186],"highlight":[187],"useful":[191],"lens":[192],"framework":[195],"structuring":[197],"improving":[199],"approaches.":[202]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-25T00:00:00"}