An abstract model for branch and cut
From MaRDI portal
Publication:6589748
DOI10.1007/s10107-023-01991-zMaRDI QIDQ6589748
Pierre Le Bodic, Aleksandr M. Kazachkov, Sriram Sankaranarayanan
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Branching on general disjunctions
- On the enumerative nature of Gomory's dual cutting plane method
- Improved strategies for branching on general disjunctions
- An abstract model for branching and its application to mixed integer programming
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- An abstract model for branch-and-cut
- Further results on an abstract model for branching and its application to mixed integer programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Outline of an algorithm for integer solutions to linear programs
- An Automatic Method of Solving Discrete Programming Problems
- An implicit enumeration procedure for the general linear complementarity problem
- Cutting Plane Generation through Sparse Principal Component Analysis
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- Mixed Integer Programming: Analyzing 12 Years of Progress
This page was built for publication: An abstract model for branch and cut