Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts

DOI10.1007/978-3-031-32726-1_20zbMath1528.90160arXiv2303.00237OpenAlexW4377199993MaRDI QIDQ6086008

Egon Balas, Aleksandr M. Kazachkov

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• Monoidal cut strengthening revisited
• Intersection cuts from multiple rows: a disjunctive programming approach
• Strong-branching inequalities for convex mixed integer nonlinear programs
• On the separation of disjunctive cuts
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• Computing with multi-row gomory cuts
• Strengthening cuts for mixed integer programs
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
• Split closure and intersection cuts
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• A disjunctive cut strengthening technique for convex MINLP
• The (not so) trivial lifting in two dimensions
• Lift-and-project for general two-term disjunctions
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On optimizing over lift-and-project closures
• Cutting planes from two-term disjunctions
• MIPLIB 2003
• The strength of multi-row models
• Two row mixed-integer cuts via lifting
• Experiments with Two-Row Cuts from Degenerate Tableaux
• On the Practical Strength of Two-Row Tableau Cuts
• Integer Programming
• Disjunctive Programming
• Lectures on Polytopes
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Multirow Intersection Cuts Based on the Infinity Norm
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Some continuous functions related to corner polyhedra
• Elementary closures for integer programs.