The m-Center Problem: Minimax Facility Location

R. S. Garfinkel, A. W. Neebe and M. R. Rao
Additional contact information
R. S. Garfinkel: University of Tennessee
A. W. Neebe: University of North Carolina
M. R. Rao: University of Rochester and Indian Institute of Management, Bangalore, India

Management Science, 1977, vol. 23, issue 10, 1133-1142

Abstract: The m-Center Problem is to locate a given number of (emergency) facilities anywhere along a road network so as to minimize the maximum distance between these facilities and fixed demand locations assigned to them. Fundamental properties of the m-Center Problem are examined. The problem is modeled using integer programming, and is successfully attacked using a binary search technique and a combination of exact tests and heuristics. Computational results are given.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.10.1133 (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:ormnsc:v:23:y:1977:i:10:p:1133-1142

Access Statistics for this article

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