Pages that link to "Item:Q5429253"
From MaRDI portal
The following pages link to Inequalities from Two Rows of a Simplex Tableau (Q5429253):
Displaying 19 items.
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← 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)
- Approximation of Corner Polyhedra with Families of Intersection Cuts (Q4637498) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Constructing Lattice-Free Gradient Polyhedra in Dimension Two (Q5041758) (← links)
- Multirow Intersection Cuts Based on the Infinity Norm (Q5084619) (← 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)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
