{"id":"https://openalex.org/W7156896742","doi":"https://doi.org/10.48550/arxiv.2604.23053","title":"ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs","display_name":"ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs","publication_year":2026,"publication_date":"2026-04-24","ids":{"openalex":"https://openalex.org/W7156896742","doi":"https://doi.org/10.48550/arxiv.2604.23053"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.23053","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23053","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.23053","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134806327","display_name":"Weimin Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Huang, Weimin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042904619","display_name":"Natalie M. Isenberg","orcid":"https://orcid.org/0000-0003-3050-1597"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Isenberg, Natalie M.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019969465","display_name":"J\u00e1n Drgo\u0148a","orcid":"https://orcid.org/0000-0003-1223-208X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Drgo\u0148a, J\u00e1n","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047724723","display_name":"Draguna Vrabie","orcid":"https://orcid.org/0000-0002-1547-2049"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vrabie, Draguna L","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087538704","display_name":"Bistra Dilkina","orcid":"https://orcid.org/0000-0002-6784-473X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dilkina, Bistra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5134806327"],"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.6482999920845032,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.6482999920845032,"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.09189999848604202,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0771000012755394,"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.7857999801635742},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5127999782562256},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4837999939918518},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4577000141143799},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.44699999690055847},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42089998722076416},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41280001401901245},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.4097999930381775}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7857999801635742},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5755000114440918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5703999996185303},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5127999782562256},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4837999939918518},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4577000141143799},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44699999690055847},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41280001401901245},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.4097999930381775},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.40049999952316284},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C66905080","wikidata":"https://www.wikidata.org/wiki/Q17005494","display_name":"Binary classification","level":3,"score":0.3255000114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3203999996185303},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3154999911785126},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2896000146865845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2840999960899353},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.2540999948978424},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.23053","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23053","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.23053","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23053","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":[{"score":0.8731831908226013,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Mixed":[0,100],"Binary":[1,101],"Quadratic":[2,102],"Programs":[3,78,103],"(MBQPs)":[4,104],"are":[5,81],"an":[6],"important":[7],"and":[8,107,129,145,150,160,164,176,196],"complex":[9],"set":[10],"of":[11,38,44,64,71],"problems":[12,21],"in":[13,142,199],"combinatorial":[14,19,57,88],"optimization.":[15],"As":[16],"solving":[17],"large-scale":[18],"optimization":[20,58,208],"is":[22],"challenging,":[23],"primal":[24,97,174],"heuristics":[25,98,175],"have":[26],"been":[27],"developed":[28,168],"to":[29,51,83,86,116,147],"quickly":[30],"identify":[31],"high-quality":[32],"solutions":[33],"within":[34],"a":[35,41,68,120,130,203],"short":[36],"amount":[37],"time.":[39],"Recently,":[40],"growing":[42],"body":[43,70],"research":[45],"has":[46,73],"also":[47],"used":[48],"machine":[49],"learning":[50],"accelerate":[52],"solution":[53,114,127,143],"methods":[54,157,170,192],"for":[55,99,125],"challenging":[56,82],"problems.":[59],"Despite":[60],"the":[61,87,156,167],"increasing":[62],"popularity":[63],"these":[65],"ML-guided":[66,96,112,169],"methods,":[67],"large":[69],"work":[72,94,110],"focused":[74],"on":[75,111,158,202],"Mixed-Integer":[76],"Linear":[77],"(MILPs).":[79],"MBQPs":[80],"solve":[84],"due":[85],"complexity":[89],"coupled":[90],"with":[91,182,186],"nonlinearities.":[92],"This":[93],"proposes":[95],"by":[105],"adapting":[106],"extending":[108],"existing":[109,139,173],"MILP":[113],"prediction":[115,128,144],"MBQPs.":[117],"We":[118,154],"introduce":[119],"new":[121,131],"neural":[122],"network":[123],"architecture":[124],"MBQP":[126,162],"training":[132],"data":[133],"collection":[134],"procedure.":[135],"Moreover,":[136],"we":[137],"extend":[138],"loss":[140],"functions":[141],"propose":[146],"combine":[148],"contrastive":[149],"weighted":[151],"cross-entropy":[152],"losses.":[153],"evaluate":[155],"standard":[159],"real-world":[161,204],"benchmarks":[163],"show":[165],"that":[166],"significantly":[171],"outperform":[172,189],"state-of-the-art":[177],"solvers.":[178],"Furthermore,":[179],"models":[180],"trained":[181],"our":[183],"proposed":[184],"extension":[185],"combined":[187],"losses":[188],"other":[190],"ML-based":[191],"adapted":[193],"from":[194],"MILPs":[195],"improve":[197],"generalization":[198],"cross-regional":[200],"inference":[201],"wind":[205],"farm":[206],"layout":[207],"problem.":[209]},"counts_by_year":[],"updated_date":"2026-05-04T08:30:34.212998","created_date":"2026-04-29T00:00:00"}