The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

DOI10.1016/J.DAM.2014.06.008zbMath1303.90014OpenAlexW2024965808MaRDI QIDQ741538

Naoki Katoh, Naoyuki Kamiyama

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.008

zbMATH Keywords

dynamic network flowuniform path-lengthsuniversally quickest transshipment

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (1)

Temporal flows in temporal networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Multicommodity flows over time: Efficient algorithms and complexity
• Faster Algorithms for the Quickest Transshipment Problem
• The Quickest Transshipment Problem
• Earliest Arrival Flows with Multiple Sources
• Optimal dynamic routing in communication networks with continuous traffic
• The Minimum Weight In-Tree Cover Problem
• A new approach to the maximum-flow problem
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• Optimal flows in networks with multiple sources and sinks
• Maximal, Lexicographic, and Dynamic Network Flows
• A good algorithm for lexicographically optimal flows in multi-terminal networks
• A Fast Parametric Maximum Flow Algorithm and Applications
• Quickest Flows Over Time

This page was built for publication: The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths