Pages that link to "Item:Q5429253"
From MaRDI portal
The following pages link to Inequalities from Two Rows of a Simplex Tableau (Q5429253):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- On mixed-integer sets with two integer variables (Q408383) (← links)
- Composite lifting of group inequalities and an application to two-row mixing inequalities (Q429671) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts (Q433114) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Sufficiency of cut-generating functions (Q494318) (← links)
- Cutting planes from extended LP formulations (Q507316) (← 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)
- Cut generation through binarization (Q896284) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
- Computing with multi-row gomory cuts (Q969515) (← 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)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- Intersection cuts -- standard versus restricted (Q1751139) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- A proof of Lovász's theorem on maximal lattice-free sets (Q1943344) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← 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)
- ``Facet'' separation with one linear program (Q2330653) (← 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)
- A 3-slope theorem for the infinite relaxation in the plane (Q2434989) (← links)
- An algorithm for the separation of two-row cuts (Q2436649) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- Mixed-integer sets from two rows of two adjacent simplex bases (Q2638388) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Cut-Generating Functions for Integer Variables (Q2833108) (← links)
