On Maximal S-Free Convex Sets

DOI10.1137/100796947zbMath1226.90045OpenAlexW1985421194MaRDI QIDQ3094917

Diego A. Morán R., Santanu S. Dey

Publication date: 27 October 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100796947

zbMATH Keywords

cutting planesinteger nonlinear programmingmaximal lattice-free convex sets

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Tight bounds on discrete quantitative Helly numbers ⋮ Maximal Quadratic-Free Sets ⋮ Closedness of Integer Hulls of Simple Conic Sets ⋮ Mixed-Integer Convex Representability ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ Optimality certificates for convex minimization and Helly numbers ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ An extremal property of lattice polygons ⋮ On Subadditive Duality for Conic Mixed-integer Programs ⋮ Maximal $S$-Free Convex Sets and the Helly Number ⋮ Cut-Generating Functions and S-Free Sets ⋮ A geometric approach to cut-generating functions ⋮ Maximal quadratic-free sets

This page was built for publication: On Maximal S-Free Convex Sets