Technical Note—The Discrete Anti-P-Center Problem

DOI10.1287/TRSC.28.1.77MaRDI QIDQ4291467zbMATH OpenOpenAlexFDO

Authors C. M. Klein, Rex K. Kincaid

Publication date 10 May 1994

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.28.1.77

zbMATH Keywords

discrete anti-\(p\)-center problemobnoxious facilities

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1340522
• The discrete p-maxian location problem
• Location of Multiple Obnoxious Facilities
• The disruptive anti-covering location problem
• An \(O(mn)\) algorithm for the anti-cent-dian problem

Cited in

(6)

• Dominant, an algorithm for the \(p\)-center problem.
• Center problems with pos/neg weights on trees
• scientific article; zbMATH DE number 4209906 (Why is no real title available?)
• scientific article; zbMATH DE number 1340522 (Why is no real title available?)
• The Location of Undesirable Facilities
• A branch-and-cut method for the obnoxious \(p\)-median problem

This page was built for publication: Technical Note—The Discrete Anti-P-Center Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291467)