Colourful linear programming
From MaRDI portal
Publication:4645909
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Generalization of Radon's Theorem
- A generalization of Caratheodory's theorem
- Colourful linear programming
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- Oriented matroid polytopes and polyhedral fans are signable
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Point Selections and Weak ε-Nets for Convex Hulls
- Signable posets and partitionable simplicial complexes
- Tverberg's theorem via number fields
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)