Tropical Carathéodory with matroids
From MaRDI portal
Publication:2679600
Recommendations
Cites work
- A generalization of Caratheodory's theorem
- A note on tropical linear and integer programs
- A topological colorful Helly theorem
- Bottleneck extrema
- Carathéodory, Helly and the others in the max-plus world
- Carathéodory-type theorems à la Bárány
- Colorful linear programming, Nash equilibrium, and pivots
- Colorful simplicial depth, Minkowski sums, and generalized Gale transforms
- Colourful Linear Programming and its Relatives
- Colourful simplicial depth
- Computing the vertices of tropical polyhedra using directed hypergraphs
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Essentials of Tropical Combinatorics
- Generalized versions of Hall's theorem
- Greedoids
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Max-linear systems. Theory and algorithms.
- OPTIMAL MATROID BASES: AN ALGORITHM BASED ON COCIRCUITS
- Points surrounding the origin
- Reducibility among combinatorial problems
- Scheduling with AND/OR Precedence Constraints
- The colourful simplicial depth conjecture
- The intersection of a matroid and an oriented matroid
- Tropical convexity
- Tropical Polytopes and Cellular Resolutions
- Tropicalizing the simplex algorithm
- Tropically convex constraint satisfaction
- Very colorful theorems
- Weighted digraphs and tropical cones
Cited in
(6)
This page was built for publication: Tropical Carathéodory with matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679600)