A note on the location of an obnoxious facility on a network
From MaRDI portal
Publication:1579481
Cites work
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- Analytical models for locating undesirable facilities
- Finite Dominating Sets for Network Location Problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Location of Multiple Obnoxious Facilities
- The art and theory of dynamic programming
Cited in
(13)- The minimum weighted covering location problem with distance constraints
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- The obnoxious center problem on weighted cactus graphs.
- The \(\beta \)-reliable minimax and maximin location problems on a network with probabilistic weights
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- The Location of Undesirable Facilities
- scientific article; zbMATH DE number 7746263 (Why is no real title available?)
- Strategy-proof mechanism for obnoxious facility location on a line
- Undesirable facility location problems on multicriteria networks
- An \(O(mn)\) algorithm for the anti-cent-dian problem
- Approximation strategy-proof mechanisms for obnoxious facility location on a line
- Obnoxious facility location: complete service with minimal harm
- An iterated local search for the budget constrained generalized maximal covering location problem
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)
