CAMBranch: Contrastive Learning with Augmented MILPs for Branching
Jiacheng Lin, Meng Xu, Zhihua Xiong, Huangang Wang
Abstract
Recent advancements have introduced machine learning frameworks to enhance the Branch and Bound (B&B) branching policies for solving Mixed Integer Linear Programming (MILP). These methods, primarily relying on imitation learning of Strong Branching, have shown superior performance. However, collecting expert samples for imitation learning, particularly for Strong Branching, is a time-consuming endeavor. To address this challenge, we propose Contrastive Learning with Augmented MILPs for Branching (CAMBranch), a framework that generates Augmented MILPs (AMILPs) by applying variable shifting to limited expert data from their original MILPs. This approach enables the acquisition of a considerable number of labeled expert samples. CAMBranch leverages both MILPs and AMILPs for imitation learning and employs contrastive learning to enhance the model's ability to capture MILP features, thereby improving the quality of branching decisions. Experimental results demonstrate that CAMBranch, trained with only 10% of the complete dataset, exhibits superior performance. Ablation studies further validate the effectiveness of our method.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- MILP-StuDio: MILP Instance Generation via Block Structure DecompositionHaoyang Liu, Jie Wang, Wanbo Zhang, Zijie Geng et al.NeurIPS 2024 · 19 citations
- Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear ProgrammingHaoyang Liu, Jie Wang, Zijie Geng, Xijun Li et al.ICLR 2025
- FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear ProgrammingHongpei Li, Hui Yuan, Han Zhang, Jianghao Lin et al.ICLR 2026
Builds on11
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Bootstrap Your Own Latent - A New Approach to Self-Supervised LearningJean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec et al.NeurIPS 2020 · 9,171 citations
- Supervised Contrastive LearningPrannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna et al.NeurIPS 2020 · 7,049 citations
- Unsupervised Learning of Visual Features by Contrasting Cluster AssignmentsMathilde Caron, Ishan Misra, Julien Mairal, Priya Goyal et al.NeurIPS 2020 · 5,249 citations
- Are Graph Augmentations Necessary?: Simple Graph Contrastive Learning for RecommendationJunliang Yu, Hongzhi Yin, Xin Xia, Tong Chen et al.SIGIR 2022 · 658 citations
Related papers
- Parameterizing Branch-and-Bound Search Trees to Learn Branching PoliciesGiulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua BengioAAAI 2021 · 123 citations
- Dynamic Stratified Contrastive Learning with Upstream Augmentation for MILP BranchingTongkai Lu, Shuai Ma, Chongyang TaoICML 2026
- Reinforcement Learning for Branch-and-Bound Optimisation Using Retrospective TrajectoriesChristopher W. F. Parsonson, Alexandre Laterre, Thomas D. BarrettAAAI 2023 · 30 citations
- Towards Imitation Learning to Branch for MIP: A Hybrid Reinforcement Learning based Sample Augmentation ApproachChangwen Zhang, Wenli Ouyang, Hao Yuan, Liming Gong et al.ICLR 2024 · 9 citations
- Towards Better Branching Policies: Leveraging the Sequential Nature of Branch-and-Bound TreeCe Zhang, Bin Zhang, Guoliang FanICLR 2026
