Approximating earliest arrival flows with flow-dependent transit times
From MaRDI portal
Publication:867858
DOI10.1016/j.dam.2006.04.030zbMath1112.90007MaRDI QIDQ867858
Ekkehard Köhler, Nadine Baumann
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
90B10: Deterministic network models in operations research
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item