Pages that link to "Item:Q3169050"
From MaRDI portal
The following pages link to Minimal Valid Inequalities for Integer Constraints (Q3169050):
Displayed 47 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- Minimal cut-generating functions are nearly extreme (Q1801006) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- On the facets of mixed integer programs with two integer variables and two constraints (Q2390999) (← links)
- The master equality polyhedron with multiple rows (Q2429471) (← links)
- An algorithm for the separation of two-row cuts (Q2436649) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Cut-Generating Functions for Integer Variables (Q2833108) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- A Probabilistic Analysis of the Strength of the Split and Triangle Closures (Q3009748) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- Operations that Preserve the Covering Property of the Lifting Region (Q3454508) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles (Q3503866) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case (Q5245017) (← links)
- Cut-Generating Functions and <i>S</i>-Free Sets (Q5252221) (← links)
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints (Q5458539) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Enumeration and unimodular equivalence of empty delta-modular simplices (Q6134052) (← links)