An abstract model for branch-and-cut

DOI10.1007/978-3-031-06901-7_25zbMath1497.90132arXiv2111.09907OpenAlexW3217125900MaRDI QIDQ2164714

Sriram Sankaranarayanan, Pierre Le Bodic, Aleksandr M. Kazachkov

Publication date: 16 August 2022

Full work available at URL: https://arxiv.org/abs/2111.09907

zbMATH Keywords

integer programmingbranch-and-boundcutting planes

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Branching on general disjunctions
• Improved strategies for branching on general disjunctions
• An abstract model for branching and its application to mixed integer programming
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• 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
• Lower bounds on the size of general branch-and-bound trees
• 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
• 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