Learn2Aggregate: Supervised Generation of Chvatal-Gomory Cuts Using Graph Neural Networks
Arnaud Deza, Elias B. Khalil, Zhenan Fan, Zirui Zhou, Yong Zhang
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper4
- Learning to Cut by Looking Ahead: Cutting Plane Selection via Imitation LearningMax B. Paulus, Giulia Zarpellon, Andreas Krause, Laurent Charlin 等ICML 2022 · 被引用 86 次
- Learning to Schedule Heuristics in Branch and BoundAntonia Chmiela, Elias B. Khalil, Ambros M. Gleixner, Andrea Lodi 等NeurIPS 2021 · 被引用 79 次
- MIP-GNN: A Data-Driven Framework for Guiding Combinatorial SolversElias B. Khalil, Christopher Morris, Andrea LodiAAAI 2022 · 被引用 75 次
- Learning to Remove Cuts in Integer Linear ProgrammingPol Puigdemont, Stratis Skoulakis, Grigorios Chrysos, Volkan CevherICML 2024 · 被引用 4 次
相关 Paper
- Learning to Configure Separators in Branch-and-CutSirui Li, Wenbin Ouyang, Max B. Paulus, Cathy WuNeurIPS 2023 · 被引用 26 次
- Predicting Lagrangian Multipliers for Mixed Integer Linear ProgramsFrancesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel ParmentierICML 2024 · 被引用 6 次
- How hard is learning to cut? Trade-offs and sample complexitySammy Khalife, Andrea LodiICLR 2026 · 被引用 1 次
- Learning Cut Generating Functions for Integer ProgrammingHongyu Cheng, Amitabh BasuNeurIPS 2024 · 被引用 10 次
- Hybrid Models for Learning to BranchPrateek Gupta, Maxime Gasse, Elias B. Khalil, Pawan Kumar Mudigonda 等NeurIPS 2020 · 被引用 179 次
