Abstract
The absolute m-center problem is a minimax location model particularly suitable for locating emergency facilities on a transportation network. The problem has been well studied for the case of an undirected network. In this note we give a vertex optimality property for the directed version of the problem and show its equivalence to the vertex m-center problem.
| Original language | English |
|---|---|
| Pages (from-to) | 300-302 |
| Number of pages | 3 |
| Journal | Transportation Science |
| Volume | 18 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1984 |