The Absolute m -Center Problem on a Directed Network

Gabriel Y. Handler
Additional contact information
Gabriel Y. Handler: Tel Aviv University, Tel Aviv, Israel

Transportation Science, 1984, vol. 18, issue 3, 300-302

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.

Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.18.3.300 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:18:y:1984:i:3:p:300-302

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().