scientific article
From MaRDI portal
Publication:3128904
zbMath0867.90048MaRDI QIDQ3128904
Publication date: 23 April 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial time algorithmdynamic networkevacuation problemearliest arrival flow problemlexicographic maximum dynamic flowminimum cost flow computation
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (28)
Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm ⋮ Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations ⋮ Approximating earliest arrival flows with flow-dependent transit times ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ A novel method for planning a staged evacuation ⋮ Minimum cost dynamic flows: The series-parallel case ⋮ FlowLoc problems with maximum excess flow ⋮ Scheduling arc maintenance jobs in a network to maximize total flow over time ⋮ Pattern-based evacuation planning for urban areas ⋮ Optimal egress time calculation and path generation for large evacuation networks ⋮ Facility location for large-scale emergencies ⋮ An Introduction to Network Flows over Time ⋮ Unnamed Item ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ Network flow with intermediate storage: models and algorithms ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Universally maximum flow with piecewise-constant capacities ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network ⋮ Improved algorithms for the evacuation route planning problem ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ A Stackelberg strategy for routing flow over time ⋮ Optimal building evacuation time considering evacuation routes ⋮ Traffic Networks and Flows over Time ⋮ One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs ⋮ Minimum-cost dynamic flows: The series-parallel case ⋮ Efficient continuous-time dynamic network flow algorithms ⋮ Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems
This page was built for publication:
