A note on the location of an obnoxious facility on a network

DOI10.1016/S0377-2217(98)00237-9zbMath0985.90061MaRDI QIDQ1579481

Oded Berman, Zvi Drezner

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

networklocationmaximin problemobnoxious faciity

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (12)

A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks ⋮ The minimum weighted covering location problem with distance constraints ⋮ Undesirable facility location problems on multicriteria networks ⋮ Solving the semi-desirable facility location problem using bi-objective particle swarm ⋮ Strategy-Proof Mechanism for Obnoxious Facility Location on a Line ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem ⋮ Unnamed Item ⋮ The obnoxious center problem on weighted cactus graphs. ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ The β-reliable minimax and maximin location problems on a network with probabilistic weights ⋮ Approximation strategy-proof mechanisms for obnoxious facility location on a line ⋮ The Location of Undesirable Facilities

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Analytical models for locating undesirable facilities
• The art and theory of dynamic programming
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Location of Multiple Obnoxious Facilities
• Finite Dominating Sets for Network Location Problems

This page was built for publication: A note on the location of an obnoxious facility on a network