Cut generation through binarization

DOI10.1007/S10107-015-0924-ZMaRDI QIDQ896284zbMATHOpenAlexFDO

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

zbMATH Keywords

closurebinarizationsplit cuts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

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

Cites work

• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Chvátal closures for mixed integer programming problems
• Computational experiments with cross and crooked cross cuts
• Cook, Kannan and Schrijver's example revisited
• Curvature inequalities for Lagrangian submanifolds: the final solution
• Cut generation through binarization
• Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
• Inequalities from Two Rows of a Simplex Tableau
• MIPLIB 2003
• MIR closures of polyhedral sets
• On optimizing over lift-and-project closures
• On the Value of Binary Expansions for General Mixed-Integer Linear Programs
• On the facets of mixed integer programs with two integer variables and two constraints
• On the relative strength of different generalizations of split cuts
• On the relative strength of split, triangle and quadrilateral cuts
• Optimizing over the split closure
• Strengthening cuts for mixed integer programs
• The strength of multi-row models
• ``Binarize and project to generate cuts for general mixed-integer programs

Cited in

(8)

• 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
• Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
• Cut generation through binarization
• Binary extended formulations and sequential convexification
• ``Binarize and project to generate cuts for general mixed-integer programs

Describes a project that uses

Uses Software

• MIPLIB
• MIPLIB2003

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)