Technical Note—The Discrete Anti-P-Center Problem

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.