Colourful linear programming
From MaRDI portal
Publication:4645909
DOI10.1007/3-540-61310-2_1zbMATH Open1415.90095OpenAlexW1565683687MaRDI QIDQ4645909FDOQ4645909
Authors: 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
Recommendations
- Colourful Linear Programming and its Relatives
- A further generalization of the colourful Carathéodory theorem
- Colorful linear programming, Nash equilibrium, and pivots
- The colourful feasibility problem
- The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- A generalization of Caratheodory's theorem
- Signable posets and partitionable simplicial complexes
- A Generalization of Radon's Theorem
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Tverberg's theorem via number fields
- Point Selections and Weak ε-Nets for Convex Hulls
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- Oriented matroid polytopes and polyhedral fans are signable
- Colourful linear programming
Cited In (4)
This page was built for publication: Colourful linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645909)
