Pages that link to "Item:Q2349120"
From MaRDI portal
The following pages link to A geometric approach to cut-generating functions (Q2349120):
Displaying 21 items.
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
- Extreme functions with an arbitrary number of slopes (Q1801005) (← links)
- Minimal cut-generating functions are nearly extreme (Q1801006) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
- Piecewise smooth extreme functions are piecewise linear (Q2288193) (← links)
- An extreme function which is nonnegative and discontinuous everywhere (Q2288200) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← 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)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← 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)
- Constructing Lattice-Free Gradient Polyhedra in Dimension Two (Q5041758) (← links)
- Optimal Cutting Planes from the Group Relaxations (Q5108238) (← links)
- Approximation of Minimal Functions by Extreme Functions (Q5376455) (← links)
- Nonunique Lifting of Integer Variables in Minimal Inequalities (Q5376544) (← links)
- Enumeration and unimodular equivalence of empty delta-modular simplices (Q6134052) (← links)
