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.
-
Availability:
- Find a library where document is available. Order URL: https://www.library.northwestern.edu/find-borrow-request/requests-interlibrary-loan/lending-institutions.html
-
Authors:
- Handler, G Y
- Publication Date: 1984-8
Media Info
- Features: References;
- Pagination: p. 300-302
-
Serial:
- Transportation Science
- Volume: 18
- Issue Number: 3
- Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
- ISSN: 0041-1655
- Serial URL: http://transci.journal.informs.org/
Subject/Index Terms
- TRT Terms: Decision making; Electromagnetic fields; Graph theory; Highways; Location; Mathematical methods; Mathematical models; Networks; Planning; Transportation
- Uncontrolled Terms: Models
- Old TRIS Terms: Highway emergency facilities; Highway systems; Minimax location problem
- Subject Areas: Design; Planning and Forecasting; Transportation (General); I21: Planning of Transport Infrastructure;
Filing Info
- Accession Number: 00391754
- Record Type: Publication
- Source Agency: Engineering Index
- Files: TRIS
- Created Date: Jan 30 1985 12:00AM