Pages that link to "Item:Q3169114"
From MaRDI portal
The following pages link to Maximal Lattice-Free Convex Sets in Linear Subspaces (Q3169114):
Displayed 47 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← 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)
- Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\) (Q526839) (← links)
- Inequalities for the lattice width of lattice-free convex sets in the plane (Q664191) (← 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)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Some cut-generating functions for second-order conic sets (Q1751217) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- Minimal cut-generating functions are nearly extreme (Q1801006) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- A proof of Lovász's theorem on maximal lattice-free sets (Q1943344) (← links)
- A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← 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)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← 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)
- An extremal property of lattice polygons (Q2313591) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- Maximal $S$-Free Convex Sets and the Helly Number (Q2835843) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- Closedness of Integer Hulls of Simple Conic Sets (Q3462546) (← links)
- Approximation of Corner Polyhedra with Families of Intersection Cuts (Q4637498) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Constructing Lattice-Free Gradient Polyhedra in Dimension Two (Q5041758) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- Multirow Intersection Cuts Based on the Infinity Norm (Q5084619) (← links)
- Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications (Q5108241) (← links)
- On Subadditive Duality for Conic Mixed-integer Programs (Q5234281) (← 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)
- 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)
- Towards a characterization of maximal quadratic-free sets (Q6086012) (← links)