Probabilistic single obnoxious facility location with fixed budget

DOI10.1016/J.IPL.2011.09.001zbMath1236.90069OpenAlexW1974936762MaRDI QIDQ413284

Zi-Long Liu, Fang Tian

Publication date: 4 May 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.09.001

zbMATH Keywords

maximindesign of algorithmsexpropriationobnoxious facility locationquantile location problem

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Related Items (1)

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

Cites Work

• Unnamed Item
• Unnamed Item
• A probabilistic minimax location problem on the plane
• A general model for the undesirable single facility location problem
• Obnoxious Facility Location on Graphs
• The expropriation location problem
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• Optimum Locations on a Graph with Probabilistic Demands

This page was built for publication: Probabilistic single obnoxious facility location with fixed budget