Technical Note—The Discrete Anti-P-Center Problem | Zendy

Cerry M. Klein | Zendy; Rex K. Kincaid | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—The Discrete Anti-P-Center Problem

Author(s) -

Cerry M. Klein,

Rex K. Kincaid

Publication year - 1994

Publication title -

transportation science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.965

H-Index - 115

eISSN - 1526-5447

pISSN - 0041-1655

DOI - 10.1287/trsc.28.1.77

Subject(s) - center (category theory) , hazardous waste , facility location problem , 1 center problem , mathematical optimization , location model , computer science , engineering , mathematics , operations research , waste management , chemistry , crystallography

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research