Pages that link to "Item:Q2349120"

The following pages link to A geometric approach to cut-generating functions (Q2349120):

Displaying 34 items.

• Origin and early evolution of corner polyhedra (Q323202) (← links)
• Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
• Corner polyhedra and their connection with cutting planes (Q1424273) (← links)
• T-space and cutting planes (Q1424274) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
• Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
• Extreme functions with an arbitrary number of slopes (Q1801005) (← links)
• Minimal cut-generating functions are nearly extreme (Q1801006) (← links)
• Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
• Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
• Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
• Design and verify: a new scheme for generating cutting-planes (Q2248750) (← 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)
• Cut-generating functions for integer variables (Q2833108) (← links)
• Maximal \(S\)-free convex sets and the Helly number (Q2835843) (← links)
• Helly’s theorem: New variations and applications (Q2979647) (← links)
• The generalized good cut equation (Q3069465) (← 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)
• (Q5417618) (← links)
• A note on characterizing canonical cuts using geometry (Q5449873) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
• Geometry of cuts and metrics (Q5906765) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)