Minimal valid inequalities for integer constraints
From MaRDI portal
Recommendations
Cited in
(50)- On degenerate multi-row Gomory cuts
- Stable sets, corner polyhedra and the Chvàtal closure
- Intersection cuts for single row corner relaxations
- Theoretical challenges towards cutting-plane selection
- A quantitative Doignon-Bell-Scarf theorem
- Generalized intersection cuts and a new cut generating paradigm
- On a generalization of the Chvátal-Gomory closure
- Maximal quadratic-free sets
- Lattice-free simplices with lattice width \(2d - o(d)\)
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Generating valid linear inequalities for nonlinear programs via sums of squares
- The triangle closure is a polyhedron
- Minimal infeasible constraint sets in convex integer programs
- The (not so) trivial lifting in two dimensions
- The strength of multi-row aggregation cuts for sign-pattern integer programs
- A geometric approach to cut-generating functions
- On the facets of mixed integer programs with two integer variables and two constraints
- The master equality polyhedron with multiple rows
- An algorithm for the separation of two-row cuts
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Two row mixed-integer cuts via lifting
- On minimal valid inequalities for mixed integer conic programs
- Cut-generating functions for integer variables
- Computational experiments with cross and crooked cross cuts
- On the practical strength of two-row tableau cuts
- Helly’s theorem: New variations and applications
- A probabilistic analysis of the strength of the split and triangle closures
- Constrained infinite group relaxations of MIPs
- Minimal inequalities for an infinite relaxation of integer programs
- On sublinear inequalities for mixed integer conic programs
- When Lift-and-Project Cuts Are Different
- Operations that preserve the covering property of the lifting region
- Computing with Multi-row Gomory Cuts
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Unique lifting of integer variables in minimal inequalities
- Strengthening lattice-free cuts using non-negativity
- Monoidal cut strengthening revisited
- Intersection cuts from multiple rows: a disjunctive programming approach
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- Maximal quadratic-free sets
- Equivariant perturbation in Gomory and Johnson's infinite group problem. I: The one-dimensional case
- Cut-generating functions and S-free sets
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- On the implementation and strengthening of intersection cuts for QCQPs
- On the implementation and strengthening of intersection cuts for QCQPs
- Enumeration and unimodular equivalence of empty delta-modular simplices
- On the relative strength of split, triangle and quadrilateral cuts
- A note on the split rank of intersection cuts
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Equivalence between intersection cuts and the corner polyhedron
This page was built for publication: Minimal valid inequalities for integer constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169050)
