Cut generation through binarization
From MaRDI portal
Publication:896284
DOI10.1007/S10107-015-0924-ZzbMATH Open1327.90128OpenAlexW2206991147MaRDI QIDQ896284FDOQ896284
Authors: Pierre Bonami, François Margot 
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
Recommendations
- Cut generation through binarization
- ``Binarize and project to generate cuts for general mixed-integer programs
- Lattice reformulation cuts
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- MIPLIB 2003
- Strengthening cuts for mixed integer programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Inequalities from Two Rows of a Simplex Tableau
- Title not available (Why is that?)
- On optimizing over lift-and-project closures
- Optimizing over the split closure
- On the relative strength of split, triangle and quadrilateral cuts
- Chvátal closures for mixed integer programming problems
- On the facets of mixed integer programs with two integer variables and two constraints
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- MIR closures of polyhedral sets
- Cook, Kannan and Schrijver's example revisited
- Curvature inequalities for Lagrangian submanifolds: the final solution
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- On the relative strength of different generalizations of split cuts
- The strength of multi-row models
- Computational experiments with cross and crooked cross cuts
- Cut generation through binarization
- ``Binarize and project to generate cuts for general mixed-integer programs
Cited In (7)
- The Rank-One Quadratic Assignment Problem
- Binary extended formulations of polyhedral mixed-integer sets
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- Lattice reformulation cuts
- Cut generation through binarization
- ``Binarize and project to generate cuts for general mixed-integer programs
- Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
Uses Software
This page was built for publication: Cut generation through binarization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896284)
