ABSOLUTE M-CENTER PROBLEM ON A DIRECTED NETWORK

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.

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00391754
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Jan 30 1985 12:00AM