{"id":"https://openalex.org/W4416258835","doi":"https://doi.org/10.18653/v1/2026.acl-long.48","title":"Learn to Relax with Large Language Models: Solving Constraint Optimization Problems via Bidirectional Coevolution","display_name":"Learn to Relax with Large Language Models: Solving Constraint Optimization Problems via Bidirectional Coevolution","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W4416258835","doi":"https://doi.org/10.18653/v1/2026.acl-long.48"},"language":"en","primary_location":{"id":"doi:10.18653/v1/2026.acl-long.48","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2026.acl-long.48","pdf_url":"https://aclanthology.org/2026.acl-long.48.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://aclanthology.org/2026.acl-long.48.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100646291","display_name":"Liu B","orcid":"https://orcid.org/0000-0001-5481-1675"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Beidan Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021596402","display_name":"Zhengqiu Zhu","orcid":"https://orcid.org/0000-0002-5805-834X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhengqiu Zhu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078622343","display_name":"Chen Gao","orcid":"https://orcid.org/0000-0002-7561-5646"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen Gao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Tianle Pu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tianle Pu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113851131","display_name":"Yong Sheng Zhao","orcid":"https://orcid.org/0000-0002-4329-0103"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yong Zhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100746411","display_name":"Wei Qi","orcid":"https://orcid.org/0000-0002-7378-1392"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei Qi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100610161","display_name":"Quanjun Yin","orcid":"https://orcid.org/0000-0002-1633-174X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Quanjun Yin","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":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01288032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1075","last_page":"1094"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.8737999796867371,"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.8737999796867371,"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.013399999588727951,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.013399999588727951,"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/leverage","display_name":"Leverage (statistics)","score":0.5357000231742859},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.5288000106811523},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4837000072002411},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4309999942779541},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4023999869823456},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.39419999718666077},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.39320001006126404},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3686999976634979},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.3456000089645386}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6484000086784363},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5819000005722046},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.5288000106811523},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4837000072002411},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41519999504089355},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4023999869823456},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39419999718666077},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3456000089645386},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3222000002861023},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.30140000581741333},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2757999897003174},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.2612999975681305}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.18653/v1/2026.acl-long.48","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2026.acl-long.48","pdf_url":"https://aclanthology.org/2026.acl-long.48.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2509.12643","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.12643","pdf_url":"https://arxiv.org/pdf/2509.12643","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.12643","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.12643","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.18653/v1/2026.acl-long.48","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2026.acl-long.48","pdf_url":"https://aclanthology.org/2026.acl-long.48.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1676311869","display_name":null,"funder_award_id":"72501291","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320324150","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416258835.pdf","grobid_xml":"https://content.openalex.org/works/W4416258835.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large":[0],"Language":[1],"Model":[2],"(LLM)-based":[3],"optimization":[4],"has":[5],"recently":[6],"shown":[7],"promise":[8],"for":[9,109,117],"autonomous":[10],"problem":[11],"solving,":[12],"yet":[13],"most":[14],"approaches":[15],"still":[16],"cast":[17],"LLMs":[18],"as":[19,159],"passive":[20],"constraint":[21,54],"checkers":[22],"rather":[23],"than":[24],"proactive":[25],"strategy":[26],"designers,":[27],"limiting":[28],"their":[29],"effectiveness":[30,145],"on":[31,137],"complex":[32],"Constraint":[33,45],"Optimization":[34,46],"Problems":[35],"(COPs).To":[36],"address":[37],"this,":[38],"we":[39],"present":[40],"AutoCO,":[41],"an":[42],"end-to-end":[43],"Automated":[44],"method":[47],"that":[48,65,85],"tightly":[49],"couples":[50],"operations-research":[51],"principles":[52],"of":[53,123],"relaxation":[55,67,83],"with":[56,113],"LLM":[57,77],"reasoning.A":[58],"core":[59],"innovation":[60],"is":[61],"a":[62,97,160],"unified":[63],"triplerepresentation":[64],"binds":[66],"strategies,":[68],"algorithmic":[69],"principles,":[70],"and":[71,81,89,125,130,146,162],"executable":[72],"codes.This":[73],"design":[74],"enables":[75],"the":[76],"to":[78],"synthesize,":[79],"justify,":[80],"instantiate":[82],"strategies":[84],"are":[86],"both":[87],"principled":[88,161],"executable.To":[90],"navigate":[91],"fragmented":[92],"solution":[93,119],"spaces,":[94],"AutoCO":[95],"employs":[96],"bidirectional":[98],"global-local":[99],"coevolution":[100],"mechanism,":[101],"synergistically":[102],"coupling":[103],"Monte":[104],"Carlo":[105],"Tree":[106],"Search":[107],"(MCTS)":[108],"global":[110],"relaxationtrajectory":[111],"exploration":[112],"Evolutionary":[114],"Algorithms":[115],"(EAs)":[116],"local":[118],"intensification.This":[120],"continuous":[121],"exchange":[122],"priors":[124],"feedback":[126],"explicitly":[127],"balances":[128],"diversification":[129],"intensification,":[131],"thus":[132],"preventing":[133],"premature":[134],"convergence.Extensive":[135],"experiments":[136],"three":[138],"challenging":[139],"COP":[140],"benchmarks":[141],"validate":[142],"AutoCO's":[143],"consistent":[144],"superior":[147],"performance,":[148],"especially":[149],"in":[150],"hard":[151],"regimes":[152],"where":[153],"current":[154],"methods":[155],"degrade.Results":[156],"highlight":[157],"Au-toCO":[158],"effective":[163],"path":[164],"toward":[165],"proactive,":[166],"verifiable":[167],"LLM-driven":[168],"optimization.":[169]},"counts_by_year":[],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}