This paper details models and algorithms which can be applied to evacuation problems.
While it concentrates on building evacuation many of the results are applicable also to …

Publisher Summary This chapter discusses stochastic and dynamic networks and routing.
The chapter discusses priori optimization in routing, shortest paths, traveling salesman-type …

We study optimal multirobot path planning on graphs (MPP) over four minimization
objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance …

A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about
optimization algorithms for problems that can be formulated on graphs and networks. This …

We study the TAPF (combined target-assignment and path-finding) problem for teams of
agents in known terrain, which generalizes both the anonymous and non-anonymous multi …

In this paper, we study the problem of optimal multi-robot path planning (MPP) on graphs.
We propose two multiflow based integer linear programming (ILP) models that compute …

A dynamic network consists of a graph with capacities and transit times on its edges. The
quickest transshipment problem is defined by a dynamic network with several sources and …

We give an introduction into the fascinating area of flows over time—also called “dynamic
flows” in the literature. Starting from the early work of Ford and Fulkerson on maximum flows …

This paper connects multi-agent path planning on graphs (roadmaps) to network flow
problems, showing that the former can be reduced to the latter, therefore enabling the …

We address the problem of determining how to reroute aircraft in the air traffic control system
when faced with dynamically changing weather conditions. The overall objective of this …