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

DOI10.1016/S0377-2217(98)00237-9zbMATH Open0985.90061MaRDI QIDQ1579481FDOQ1579481

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Analytical models for locating undesirable facilities
• The art and theory of dynamic programming
• Finite Dominating Sets for Network Location Problems
• Location of Multiple Obnoxious Facilities

Cited In (13)

• Solving the semi-desirable facility location problem using bi-objective particle swarm
• The Location of Undesirable Facilities
• Undesirable facility location problems on multicriteria networks
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
• An \(O(mn)\) algorithm for the anti-cent-dian problem
• Approximation strategy-proof mechanisms for obnoxious facility location on a line
• Strategy-proof mechanism for obnoxious facility location on a line
• The obnoxious center problem on weighted cactus graphs.
• Title not available (Why is that?)
• An iterated local search for the budget constrained generalized maximal covering location problem
• The \(\beta \)-reliable minimax and maximin location problems on a network with probabilistic weights
• The minimum weighted covering location problem with distance constraints
• Obnoxious facility location: complete service with minimal harm

Uses Software

• Algorithm 97

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

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