The following pages link to (Q4733665):
Displaying 48 items.
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Some properties of convex hulls of integer points contained in general convex sets (Q378131) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts (Q433114) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- Lifting properties of maximal lattice-free polyhedra (Q896280) (← links)
- Reverse split rank (Q896287) (← links)
- Computing with multi-row gomory cuts (Q969515) (← links)
- Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
- The topological structure of maximal lattice free convex bodies: The general case (Q1380933) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← links)
- The covering radius and a discrete surface area for non-hollow simplices (Q2066303) (← links)
- Difference between families of weakly and strongly maximal integral lattice-free polytopes (Q2106280) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results (Q2359925) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- An algorithm for the separation of two-row cuts (Q2436649) (← links)
- Certificates of linear mixed integer infeasibility (Q2517805) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- Mixed-integer sets from two rows of two adjacent simplex bases (Q2638388) (← links)
- Maximal $S$-Free Convex Sets and the Helly Number (Q2835843) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Closedness of Integer Hulls of Simple Conic Sets (Q3462546) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- The Empty Sphere (Q3784139) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- Approximation of Corner Polyhedra with Families of Intersection Cuts (Q4637498) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width (Q4976155) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications (Q5108241) (← links)
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints (Q5458539) (← links)
- Poisson approximation and Weibull asymptotics in the geometry of numbers (Q5878222) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
