Parametric shortest-path algorithms via tropical geometry
From MaRDI portal
Distance in graphs (05C12) Applications of tropical geometry (14T90) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Tropical optimization (e.g., max-plus optimization) (90C24) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)
Recommendations
- Two-phase algorithms for the parametric shortest path problem
- Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees
- Shortest paths on dynamic graphs
- Faster parametric shortest path and minimum‐balance algorithms
- A Fast Parametric Maximum Flow Algorithm and Applications
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- A general approach to online network optimization problems
- A new approach to the maximum-flow problem
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- An O(n^3 n / ^2 n) time algorithm for all pairs shortest paths
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing convex hulls and counting integer points with \texttt{polymake}
- Enumerating polytropes
- Fibonacci heaps and their uses in improved network optimization algorithms
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 6437647 (Why is no real title available?)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Maintaining shortest paths under deletions in weighted directed graphs
- Max-linear systems. Theory and algorithms.
- Monomial Tropical Cones for Multicriteria Optimization
- New Bounds on the Complexity of the Shortest Path Problem
- On the robust shortest path problem.
- polymake: a framework for analyzing convex polytopes
- Robust optimization
- Robust randomized matchings
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- Tropical polyhedra are equivalent to mean payoff games
Cited in
(7)- Tropical algebras and the shortest path
- Two-phase algorithms for the parametric shortest path problem
- Parametric shortest-path algorithms via tropical geometry
- Regular flips in \texttt{mptopcom}
- Tropical combinatorics of max-linear Bayesian networks
- Tropical Fréchet means: a polyhedral approach to exact optimization
- Tropical Fréchet means
This page was built for publication: Parametric shortest-path algorithms via tropical geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868948)
