Approximating earliest arrival flows with flow-dependent transit times

DOI10.1016/j.dam.2006.04.030zbMath1112.90007OpenAlexW1974832312MaRDI QIDQ867858

Nadine Baumann, Ekkehard Köhler

Publication date: 19 February 2007

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

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

zbMATH Keywords

optimizationflows over timedynamic flowsearliest arrival flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Efficient contraflow algorithms for quickest evacuation planning ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Unnamed Item ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Traffic Networks and Flows over Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient flows in networks
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• Maximal, Lexicographic, and Dynamic Network Flows
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Constructing Maximal Dynamic Flows from Static Flows
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Approximating earliest arrival flows with flow-dependent transit times