Abstract tropical linear programming
From MaRDI portal
Publication:2188843
DOI10.37236/7718zbMath1454.14157arXiv1612.01890OpenAlexW3037560945MaRDI QIDQ2188843
Publication date: 15 June 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.01890
Linear programming (90C05) Discrete-time games (91A50) Oriented matroids in discrete geometry (52C40) Combinatorial aspects of simplicial complexes (05E45) Applications of tropical geometry (14T90)
Related Items (3)
The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory ⋮ Tropical Complementarity Problems and Nash Equilibria ⋮ Face posets of tropical polyhedra and monomial ideals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted digraphs and tropical cones
- A topological representation theorem for tropical oriented matroids
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Stiefel tropical linear spaces
- Tropical types and associated cellular resolutions
- Linear quadratic programming in oriented matroids
- A new polynomial-time algorithm for linear programming
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Triangulations. Structures for algorithms and applications
- How to draw tropical planes
- Combinatorial geometries, convex polyhedra, and Schubert cells
- An application of simultaneous diophantine approximation in combinatorial optimization
- Factoring polynomials with rational coefficients
- Positional strategies for mean payoff games
- A combinatorial abstraction of linear programming
- The geometry of products of minors
- The complexity of mean payoff games on graphs
- Maximal minors and their leading terms
- Tropical convexity
- Complexity of solving tropical linear systems
- Flag arrangements and triangulations of products of simplices
- Tropical hyperplane arrangements and oriented matroids
- A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
- Triangulations of oriented matroids
- TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES
- Tropical Cramer determinants revisited
- Tropical Effective Primary and Dual Nullstellens"atze
- Triangulations of $\Delta_{n-1} \times \Delta_{d-1}$ and Tropical Oriented Matroids
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
- From Parity and Payoff Games to Linear Programming
- Complementarity in Oriented Matroids
- Introduction to max-linear programming
- Tropicalizing the Simplex Algorithm
- Max-linear Systems: Theory and Algorithms
- Permutohedra, Associahedra, and Beyond
- Lectures on Polytopes
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Face monoid actions and tropical hyperplane arrangements
- Scheduling with AND/OR Precedence Constraints
- Deciding parity games in quasipolynomial time
- Methods and applications of (max,+) linear algebra
- Combinatorial Simplex Algorithms Can Solve Mean Payoff Games
- Tropical Polytopes and Cellular Resolutions
This page was built for publication: Abstract tropical linear programming
