Publication:3128904
From MaRDI portal
zbMath0867.90048MaRDI QIDQ3128904
Publication date: 23 April 1997
polynomial time algorithm; dynamic network; evacuation problem; earliest arrival flow problem; lexicographic maximum dynamic flow; minimum cost flow computation
90C60: Abstract computational complexity for mathematical programming problems
90B10: Deterministic network models in operations research
Related Items
Minimum-cost dynamic flows: The series-parallel case, Approximating earliest arrival flows with flow-dependent transit times, One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs, Efficient continuous-time dynamic network flow algorithms, Universally maximum flow with piecewise-constant capacities