2026
Dynamic Stratified Contrastive Learning with Upstream Augmentation for MILP Branching
ICML 2026spotlight
Mixed Integer Linear Programming (MILP) is a fundamental NP-hard problem that has garnered significant attention from both academia and industry. The Branch-and-Bound (B&B) algorithm is the dominant approach for solving MILPs, where branching decisions play a critical role and have recently been enh…