Colourful linear programming

DOI10.1007/3-540-61310-2_1zbMath1415.90095OpenAlexW1565683687MaRDI QIDQ4645909

Shmuel Onn, Imre Bárány

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_1

zbMATH Keywords

convex hullcombinatorial geometrycounting problemalgorithmic problemcolourful point

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Colourful linear programming

Cites Work

• Unnamed Item
• A generalization of Caratheodory's theorem
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Tverberg's theorem via number fields
• Signable posets and partitionable simplicial complexes
• On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
• Point Selections and Weak ε-Nets for Convex Hulls
• Colourful linear programming
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Oriented matroid polytopes and polyhedral fans are signable
• A Generalization of Radon's Theorem