Learn2Aggregate: Supervised Generation of Chvatal-Gomory Cuts Using Graph Neural Networks
Arnaud Deza, Elias B. Khalil, Zhenan Fan, Zirui Zhou, Yong Zhang
Abstract
We present Learn2Aggregate, a machine learning (ML) framework for optimizing the generation of Chvatal-Gomory (CG) cuts in mixed integer linear programming (MILP). The framework trains a graph neural network to classify useful constraints for aggregation in CG cut generation. The ML-driven CG separator selectively focuses on a small set of impactful constraints, improving runtimes without compromising the strength of the generated cuts. Key to our approach is the formulation of a constraint classification task which favours sparse aggregation of constraints, consistent with empirical findings. This, in conjunction with a careful constraint labeling scheme and a hybrid of deep learning and feature engineering, results in enhanced CG cut generation across five diverse MILP benchmarks. On the largest test sets, our method closes roughly twice as much of the integrality gap as the standard CG method while running 40% faster. This performance improvement is due to our method eliminating 75% of the constraints prior to aggregation.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0d0b3a6c-adce-4380-8438-2b83d17cec12Cited by top-tier papers1
Ask how each one uses itBuilds on4
- Learning to Cut by Looking Ahead: Cutting Plane Selection via Imitation LearningMax B. Paulus, Giulia Zarpellon, Andreas Krause, Laurent Charlin et al.ICML 2022 · 86 citations
- Learning to Schedule Heuristics in Branch and BoundAntonia Chmiela, Elias B. Khalil, Ambros M. Gleixner, Andrea Lodi et al.NeurIPS 2021 · 79 citations
- MIP-GNN: A Data-Driven Framework for Guiding Combinatorial SolversElias B. Khalil, Christopher Morris, Andrea LodiAAAI 2022 · 75 citations
- Learning to Remove Cuts in Integer Linear ProgrammingPol Puigdemont, Stratis Skoulakis, Grigorios Chrysos, Volkan CevherICML 2024 · 4 citations
Related papers
- Learning to Configure Separators in Branch-and-CutSirui Li, Wenbin Ouyang, Max B. Paulus, Cathy WuNeurIPS 2023 · 26 citations
- Predicting Lagrangian Multipliers for Mixed Integer Linear ProgramsFrancesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel ParmentierICML 2024 · 6 citations
- How hard is learning to cut? Trade-offs and sample complexitySammy Khalife, Andrea LodiICLR 2026 · 1 citation
- Learning Cut Generating Functions for Integer ProgrammingHongyu Cheng, Amitabh BasuNeurIPS 2024 · 10 citations
- Hybrid Models for Learning to BranchPrateek Gupta, Maxime Gasse, Elias B. Khalil, Pawan Kumar Mudigonda et al.NeurIPS 2020 · 179 citations
