Technical Note—The Discrete Anti-P-Center Problem

C. M. Klein and R. K. Kincaid
Additional contact information
C. M. Klein: Department of Industrial Engineering, University of Missouri-Columbia, Columbia, Missouri 65211
R. K. Kincaid: Department of Mathematics, College of William and Mary, Williamsburg, Virginia 23185

Transportation Science, 1994, vol. 28, issue 1, 77-79

Abstract: The discrete anti-p-center problem, DACPM, is to find p facility locations which will maximize the minimum distance between demand points and their respective nearest facilities. Typically this problem is used to model the location of obnoxious facilities such as incinerator plants, hazardous waste sites, unsightly factories, or correctional facilities. For the version of the discrete anti-p-center problem given by Moon and Chaudhry a practical polynomial algorithm is given.

Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.1.77 (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:28:y:1994:i:1:p:77-79

Access Statistics for this article

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