Parametric Shortest-Path Algorithms via Tropical Geometry-Reference-Cited by-同舟云学术

Parametric Shortest-Path Algorithms via Tropical Geometry

Published:2022-08 Issue:3 Volume:47 Page:2065-2081
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Joswig Michael¹²^ORCID,Schröter Benjamin³^ORCID

Affiliation:

1. Chair of Discrete Mathematics/Geometry, Technische Universität Berlin, Berlin 10623, Germany

2. Max Planck Institute for Mathematics in the Sciences, Leipzig 04103, Germany

3. Department of Mathematics, KTH Royal Institute of Technology, Stockholm SE-100 44, Sweden

Abstract

We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry. Applications include shortest paths in traffic networks with variable link travel times.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.2021.1199

Reference24 articles.

1. TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES

2. Log-Barrier Interior Point Methods Are Not Strongly Polynomial

3. A general approach to online network optimization problems

4. Computing convex hulls and counting integer points with polymake

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The price-elastic knapsack problem;Omega;2024-04

2. Regular Flips in mptopcom;Lecture Notes in Computer Science;2024

3. Tail Risk in Production Networks;Econometrica;2023