On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
From MaRDI portal
Publication:2870526
DOI10.1137/110850463zbMath1282.90109arXiv1109.6179OpenAlexW1967257095MaRDI QIDQ2870526
Publication date: 21 January 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.6179
cutting planeHelly's theoremHelly numberintersection cutlattice-free setDoignon's theorem\(S\)-convex set\(S\)-free set
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Mixed integer programming (90C11) Axiomatic and generalized convexity (52A01)
Related Items
Tight bounds on discrete quantitative Helly numbers, Homometry and direct-sum decompositions of lattice-convex sets, Centerpoints: A Link Between Optimization and Convex Geometry, Quantitative Tverberg theorems over lattices and other discrete sets, Towards a characterization of maximal quadratic-free sets, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, Helly’s theorem: New variations and applications, Optimality certificates for convex minimization and Helly numbers, Centerpoints: A Link between Optimization and Convex Geometry, A GENERALIZATION OF THE DISCRETE VERSION OF MINKOWSKI'S FUNDAMENTAL THEOREM, An extremal property of lattice polygons, On Subadditive Duality for Conic Mixed-integer Programs, Maximal $S$-Free Convex Sets and the Helly Number, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Tverberg theorems over discrete sets of points, Cut-Generating Functions and S-Free Sets, A geometric approach to cut-generating functions
