This paper surveys the facility location problems in dynamic flow networks that have been
actively studied in recent years. These problems have been motivated by evacuation …

This paper addresses the minimax regret sink location problem in dynamic tree networks. In
our model, a dynamic tree network consists of an undirected tree with positive edge lengths …

This paper considers the k-sink location problem in dynamic path networks. A dynamic path
network consists of an undirected path with positive edge lengths, uniform edge capacity …

Let P be an undirected path graph of n vertices. Each edge of P has a positive length and a
constant capacity. Every vertex has a nonnegative supply, which is an unknown value but is …

Suppose that in an emergency, such as an earthquake or fire, a number of people need to
be evacuated to a safe “sink” from every vertex of a network. The k-sink problem seeks to …

In emergencies such as earthquakes, nuclear accidents, etc., we need an evacuation plan.
We model a street, a building corridor, etc. by a path network, and consider the problem of …

We consider the problem of locating a set of k sinks on a path network with general edge
capacities that minimizes the sum of the evacuation times of all evacuees. We first present …

Given a set of existing points with their associated positive weights on the plane, the
classical Fermat–Weber problem aims to find a new point that minimizes the overall …

In this paper, we consider the minimax regret 1-sink location problem in a dynamic cycle
network with positive edge lengths and uniform edge capacity. Let C be an undirected cycle …

In Dynamic flow networks an edge's capacity is the amount of flow (items) that can enter it in
unit time. All flow must be moved to sinks and congestion occurs if flow has to wait at a …