Research map / Learning theory and algorithms / Combinatorial and search optimization
Automatic Logic-Based Benders Decomposition with MiniZinc
Toby Davies, Graeme Gange, Peter Stuckey
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use automatic LBBD (MIP master + LCG subproblem) instead of pure CP or MIP | MiniZinc model · All 7 benchmark sets (1837 instances) | quality % of best portfolio: 95.3 vs 88.7 (MIP), 79.3 (CP) | Improved |
| use LBBD instead of MIP or CP | MiniZinc model · All benchmarks | mean time to prove optimality (s): 173.8 vs 245.6 (MIP), 248.6 (CP) | Improved |
| use LBBD instead of MIP or CP | MiniZinc model · All benchmarks | instances proved optimal: 1413 (+79) vs 1254 (MIP), 1159 (CP) | Improved |
| use LBBD instead of MIP | MiniZinc model · SSCPLP and CDCPLP | quality % of best portfolio: 89.9 vs 100.0 (SSCPLP); 73.2 vs 99.8 (CDCPLP) | Hurt |
| use LBBD instead of MIP on PS-makespan | MiniZinc model · PS-makespan | quality %: 100.0 vs 57.4 | Improved |
Closest papers by meaning
- Parameterized Algorithms for MILPs with Small Treedepth (AAAI 2021 · similarity 0.85)
- A General Large Neighborhood Search Framework for Solving Integer Linear Programs (NeurIPS 2020 · similarity 0.85)
- Going Beyond Primal Treewidth for (M)ILP (AAAI 2017 · similarity 0.85)
- Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning (AAAI 2021 · similarity 0.85)
- BIPNN: Learning to Solve Binary Integer Programming via Hypergraph Neural Networks (NeurIPS 2025 · similarity 0.84)
- Generalization Guarantees for Learning Score-Based Branch-and-Cut Policies in Integer Programming (NeurIPS 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
