Pages that link to "Item:Q4170530"
From MaRDI portal
The following pages link to A Theorem Concerning the Integer Lattice (Q4170530):
Displaying 32 items.
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- The topological structure of maximal lattice free convex bodies: The general case (Q1380933) (← links)
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem (Q1707415) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- A proof of Lovász's theorem on maximal lattice-free sets (Q1943344) (← links)
- Quantitative \((p, q)\) theorems in combinatorial geometry (Q2012541) (← links)
- Discrete quantitative Helly-type theorems with boxes (Q2040992) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- Minimal infeasible constraint sets in convex integer programs (Q2268936) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- On the facets of mixed integer programs with two integer variables and two constraints (Q2390999) (← links)
- Quantitative Tverberg theorems over lattices and other discrete sets (Q2408215) (← links)
- Duality in mathematics and linear and integer programming (Q2565013) (← links)
- Two-halfspace closure (Q2689824) (← links)
- Maximal $S$-Free Convex Sets and the Helly Number (Q2835843) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization (Q4609983) (← links)
- Tverberg’s theorem is 50 years old: A survey (Q4684365) (← links)
- A Mélange of Diameter Helly-Type Theorems (Q5001848) (← links)
- Constructing Lattice-Free Gradient Polyhedra in Dimension Two (Q5041758) (← links)
- The topological structure of maximal lattice free convex bodies: The general case (Q5101419) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Integer Farkas Lemma (Q5245033) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- On Helly numbers of exponential lattices (Q6189691) (← links)
