{"id":"https://openalex.org/W7170059449","doi":"https://doi.org/10.48550/arxiv.2607.18252","title":"MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers","display_name":"MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W7170059449","doi":"https://doi.org/10.48550/arxiv.2607.18252"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.18252","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.18252","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":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.2607.18252","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112977903","display_name":"Jinbiao Nie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nie, Jinbiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088655448","display_name":"Kewei Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feng, Kewei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143421939","display_name":"Xiaoyuan Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Xiaoyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143458883","display_name":"Shan Yin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yin, Shan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085882173","display_name":"Zizhuo Wang","orcid":"https://orcid.org/0000-0003-0828-7280"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Zizhuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101687868","display_name":"Bin Dong","orcid":"https://orcid.org/0000-0002-0725-0833"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dong, Bin","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.16300000250339508,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.16300000250339508,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10142","display_name":"Formal Methods in Verification","score":0.09960000216960907,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.062199998646974564,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8723000288009644},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.7437000274658203},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5999000072479248},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.44859999418258667},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3610000014305115},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.2842000126838684}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8723000288009644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7470999956130981},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.7437000274658203},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5999000072479248},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.44859999418258667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3682999908924103},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3610000014305115},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3393000066280365},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30660000443458557},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2849999964237213},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26499998569488525},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.26010000705718994},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.18252","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.18252","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.48550/arxiv.2607.18252","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.18252","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":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":{"Machine":[0],"learning":[1],"methods":[2],"have":[3],"shown":[4],"that":[5,158,175],"data-driven":[6],"policies":[7,183],"can":[8,71,159,179],"accelerate":[9],"mixed-integer":[10],"linear":[11],"programming":[12],"(MILP)":[13],"solvers,":[14],"but":[15,51],"many":[16],"such":[17],"approaches":[18],"remain":[19],"difficult":[20],"to":[21,47],"inspect,":[22],"adapt,":[23],"and":[24,49,106,117,129,148,163],"deploy":[25],"because":[26],"the":[27,64,110,138],"learned":[28,57],"policy":[29],"is":[30,45,52],"represented":[31],"as":[32,75],"an":[33],"external":[34],"predictor":[35],"or":[36],"other":[37],"opaque":[38],"model.":[39],"By":[40],"contrast,":[41],"explicit":[42,155],"solver":[43,59,69,87,101,156,167],"logic":[44,70],"easier":[46],"understand":[48],"integrate,":[50],"usually":[53],"hand-designed":[54],"rather":[55],"than":[56],"from":[58],"feedback.":[60],"We":[61],"study":[62],"whether":[63],"automatic":[65],"design":[66,112],"of":[67,113],"MILP":[68,100,135],"instead":[72],"be":[73,160],"cast":[74],"LLM-guided":[76,176],"closed-loop":[77,95],"search":[78],"over":[79],"executable":[80],"white-box":[81],"components":[82,157],"evaluated":[83,130],"directly":[84],"by":[85,131],"end-to-end":[86],"behavior.":[88],"To":[89],"this":[90],"end,":[91],"we":[92,173],"propose":[93],"a":[94,114,118],"program":[96,177],"evolution":[97,178],"framework":[98],"for":[99],"auto-design,":[102],"implemented":[103],"through":[104],"PySCIPOpt,":[105],"instantiate":[107],"it":[108],"on":[109,134],"joint":[111],"cut":[115],"selector":[116],"branching":[119],"rule.":[120],"Candidate":[121],"programs":[122],"are":[123],"iteratively":[124],"generated,":[125],"loaded":[126],"into":[127],"SCIP,":[128],"direct":[132],"execution":[133],"instances,":[136],"with":[137],"resulting":[139],"feedback":[140],"guiding":[141],"performance-based":[142],"selection,":[143],"targeted":[144],"repair,":[145],"diagnostic":[146],"reflection,":[147],"diversity-aware":[149],"population":[150],"maintenance.":[151],"The":[152],"method":[153],"outputs":[154],"inspected,":[161],"modified,":[162],"deployed":[164],"within":[165],"standard":[166],"workflows.":[168],"Across":[169],"four":[170],"benchmark":[171],"families,":[172],"find":[174],"discover":[180],"competitive":[181],"domain-specialized":[182],"in":[184],"several":[185],"settings.":[186]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-23T00:00:00"}