An observation on the structure of production sets with indivisibilities
From MaRDI portal
Publication:4161089
DOI10.1073/pnas.74.9.3637zbMath0381.90081OpenAlexW1992399294WikidataQ35047844 ScholiaQ35047844MaRDI QIDQ4161089
Publication date: 1977
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.74.9.3637
Related Items
Transversal numbers over subsets of linear spaces, Constructing Lattice-Free Gradient Polyhedra in Dimension Two, On the facets of mixed integer programs with two integer variables and two constraints, The topological structure of maximal lattice free convex bodies: The general case, Quantitative Tverberg theorems over lattices and other discrete sets, A subexponential bound for linear programming, The number of additional variables required for the integer programming formulation, Lifting properties of maximal lattice-free polyhedra, Complexity of optimizing over the integers, A proof of Lovász's theorem on maximal lattice-free sets, On Helly numbers of exponential lattices, Two-halfspace closure, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Strengthening lattice-free cuts using non-negativity, Feasibility in reverse convex mixed-integer programming, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, Random sampling with removal, Helly’s theorem: New variations and applications, Relaxations of mixed integer sets from lattice-free polyhedra, A quantitative Doignon-Bell-Scarf theorem, Lattice translates of a polytope and the Frobenius problem, Relaxations of mixed integer sets from lattice-free polyhedra, Quantitative \((p, q)\) theorems in combinatorial geometry, Minimal infeasible constraint sets in convex integer programs, On the complexity of cutting-plane proofs, Tverberg’s theorem is 50 years old: A survey, Discrete quantitative Helly-type theorems with boxes, Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization, Maximal $S$-Free Convex Sets and the Helly Number, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Integer Farkas Lemma, A Mélange of Diameter Helly-Type Theorems, A geometric approach to cut-generating functions, A fractional Helly theorem for convex lattice sets, Constructing lattice-free gradient polyhedra in dimension two
