{"id":"https://openalex.org/W7154332253","doi":"https://doi.org/10.48550/arxiv.2604.09556","title":"Para-B&B: Load-Balanced Deterministic Parallelization of Solving MIP","display_name":"Para-B&B: Load-Balanced Deterministic Parallelization of Solving MIP","publication_year":2026,"publication_date":"2026-02-10","ids":{"openalex":"https://openalex.org/W7154332253","doi":"https://doi.org/10.48550/arxiv.2604.09556"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.09556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09556","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.2604.09556","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133554025","display_name":"Jinyu Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Jinyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133589523","display_name":"Di Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Di","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100709862","display_name":"Yue Liu","orcid":"https://orcid.org/0000-0003-3917-7623"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Yue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133579399","display_name":"Shuo Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Shuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038500240","display_name":"Zhenyu Pu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pu, Zhenyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133614634","display_name":"Zhiyuan Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Zhiyuan","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/T10904","display_name":"Embedded Systems Design Techniques","score":0.16660000383853912,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.16660000383853912,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.11379999667406082,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.09220000356435776,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8187999725341797},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5634999871253967},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5299000144004822},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4284999966621399},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42010000348091125},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4074000120162964},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.397599995136261},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3962000012397766},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.3926999866962433}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8187999725341797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8125},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.618399977684021},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5634999871253967},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5299000144004822},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41530001163482666},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4074000120162964},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.397599995136261},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.3630000054836273},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3596999943256378},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32910001277923584},{"id":"https://openalex.org/C172430144","wikidata":"https://www.wikidata.org/wiki/Q17111997","display_name":"Symmetric multiprocessor system","level":2,"score":0.3255999982357025},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3199999928474426},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3070000112056732},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.29030001163482666},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C192183473","wikidata":"https://www.wikidata.org/wiki/Q131133","display_name":"Determinism","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27219998836517334},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.260699987411499},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.09556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09556","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.2604.09556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09556","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":[{"id":"https://metadata.un.org/sdg/9","score":0.520746648311615,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Mixed-integer":[0],"programming":[1,5],"(MIP)":[2],"extends":[3],"linear":[4],"by":[6,88],"incorporating":[7],"both":[8],"continuous":[9],"and":[10,23,30,53,96,124,147,195],"integer":[11],"decision":[12],"variables,":[13],"making":[14],"it":[15],"widely":[16],"used":[17],"in":[18,37,57],"production":[19],"planning,":[20],"logistics":[21],"scheduling,":[22],"resource":[24],"allocation.":[25],"However,":[26],"MIP":[27,76],"remains":[28],"NP-hard":[29],"cannot":[31],"generally":[32],"be":[33],"solved":[34],"to":[35,50],"optimality":[36],"polynomial":[38],"time.":[39],"Branch-and-bound,":[40],"a":[41,74,81,163],"fundamental":[42],"exact":[43],"method,":[44],"faces":[45],"significant":[46],"parallelization":[47],"challenges":[48],"due":[49],"computational":[51,118],"heterogeneity":[52],"strict":[54,86],"determinism":[55,87],"requirements":[56],"commercial":[58],"applications.":[59],"This":[60],"paper":[61],"presents":[62],"the":[63],"first":[64],"fully":[65],"open-source":[66],"implementation":[67],"of":[68,167],"deterministic":[69,175],"parallel":[70,138],"branch-and-bound":[71],"for":[72,182,191],"HiGHS,":[73],"high-performance":[75],"solver.":[77],"Our":[78],"approach":[79],"introduces":[80],"novel":[82],"data-parallel":[83],"architecture":[84],"ensuring":[85],"replicating":[89],"complete":[90,174],"solver":[91],"state":[92],"across":[93],"worker":[94],"threads":[95,171],"eliminating":[97],"non-deterministic":[98],"synchronization":[99],"primitives.":[100],"A":[101],"key":[102],"innovation":[103],"is":[104],"our":[105],"AI-driven":[106],"load":[107],"balancing":[108],"mechanism":[109],"employing":[110],"multi-stage":[111],"workload":[112],"prediction":[113],"models":[114],"that":[115],"estimate":[116],"node":[117,149,184],"complexity":[119],"based":[120],"on":[121,154],"structural":[122],"characteristics":[123],"historical":[125],"performance":[126],"data,":[127],"coupled":[128],"with":[129,186],"dynamic":[130],"parameter":[131],"adjustment":[132],"strategies.":[133],"The":[134],"framework":[135],"executes":[136],"orchestrated":[137],"phases":[139],"including":[140],"concurrent":[141],"dive":[142],"operations,":[143],"systematic":[144],"data":[145],"consolidation,":[146],"intelligent":[148],"selection.":[150],"Comprehensive":[151],"experimental":[152],"evaluation":[153],"80":[155],"MIPLIB":[156],"2017":[157],"benchmark":[158],"instances":[159,194],"demonstrates":[160],"effectiveness,":[161],"achieving":[162],"geometric":[164],"mean":[165],"speedup":[166,187],"2.17":[168],"using":[169],"eight":[170],"while":[172],"maintaining":[173],"guarantees.":[176],"Performance":[177],"gains":[178],"become":[179],"increasingly":[180],"pronounced":[181],"higher":[183],"counts,":[185],"factors":[188],"reaching":[189],"5.12":[190],"computationally":[192],"intensive":[193],"thread":[196],"idle":[197],"rates":[198],"averaging":[199],"34.7%.":[200]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-15T00:00:00"}