Cut generation through binarization
From MaRDI portal
Publication:896284
DOI10.1007/s10107-015-0924-zzbMath1327.90128OpenAlexW2206991147MaRDI QIDQ896284
Pierre Bonami, Margot, François
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0924-z
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Binary extended formulations of polyhedral mixed-integer sets, The Rank-One Quadratic Assignment Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Curvature inequalities for Lagrangian submanifolds: the final solution
- On the relative strength of split, triangle and quadrilateral cuts
- MIR closures of polyhedral sets
- Chvátal closures for mixed integer programming problems
- Cook, Kannan and Schrijver's example revisited
- Strengthening cuts for mixed integer programs
- On the relative strength of different generalizations of split cuts
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the facets of mixed integer programs with two integer variables and two constraints
- On optimizing over lift-and-project closures
- MIPLIB 2003
- Optimizing over the split closure
- The strength of multi-row models
- Computational Experiments with Cross and Crooked Cross Cuts
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- Cut Generation through Binarization
- Inequalities from Two Rows of a Simplex Tableau
