Monoidal strengthening of simple V -polyhedral disjunctive cuts

DOI10.1007/S10107-024-02185-XMaRDI QIDQ7019061zbMATH OpenFDO

Authors Aleksandr M. Kazachkov, E. Balas

Publication date 5 March 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-024-02185-X

zbMATH Keywords

cutting planesdisjunctive programmingmixed integer linear programmingmonoidal strengthening

Mathematics Subject Classification ID

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

Cites work

• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• A disjunctive cut strengthening technique for convex MINLP
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Computing with multi-row gomory cuts
• Cutting planes from two-term disjunctions
• Disjunctive Programming
• Elementary closures for integer programs.
• Experiments with two-row cuts from degenerate tableaux
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3555734 (Why is no real title available?)
• scientific article; zbMATH DE number 1757966 (Why is no real title available?)
• Integer Programming
• Intersection cuts -- standard versus restricted
• Intersection cuts from multiple rows: a disjunctive programming approach
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Lectures on Polytopes
• Lift-and-project for general two-term disjunctions
• MIPLIB 2003
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
• Monoidal cut strengthening revisited
• Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
• Multirow Intersection Cuts Based on the Infinity Norm
• On optimizing over lift-and-project closures
• On the practical strength of two-row tableau cuts
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• On the separation of disjunctive cuts
• Some continuous functions related to corner polyhedra
• Split closure and intersection cuts
• Strengthening cuts for mixed integer programs
• Strong-branching inequalities for convex mixed integer nonlinear programs
• The (not so) trivial lifting in two dimensions
• The strength of multi-row models
• Theorie der einfachen Ungleichungen.
• Two row mixed-integer cuts via lifting
• When Lift-and-Project Cuts Are Different

This page was built for publication: Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019061)