scientific article
From MaRDI portal
zbMath0489.52011MaRDI QIDQ3951161
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Helly numberinteger latticehalf-spacesinteger programming problembinding constraint numberHelly systemScarf number
Integer programming (90C10) Permutations, words, matrices (05A05) Helly-type theorems and geometric transversal theory (52A35)
Related Items
Helly-type theorems and generalized linear programming, Centerpoints: A Link Between Optimization and Convex Geometry, Quantitative Tverberg theorems over lattices and other discrete sets, Complexity of optimizing over the integers, On Helly numbers of exponential lattices, Two-halfspace closure, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Unnamed Item, 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, Some cut-generating functions for second-order conic sets, Centerpoints: A Link between Optimization and Convex Geometry, Quantitative \((p, q)\) theorems in combinatorial geometry, Discrete quantitative Helly-type theorems with boxes, The voice of optimization, Maximal $S$-Free Convex Sets and the Helly Number, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, A Helly theorem for convexity in graphs, Communication complexity and combinatorial lattice theory
