Probabilistic single obnoxious facility location with fixed budget

DOI10.1016/J.IPL.2011.09.001MaRDI QIDQ413284zbMATH OpenOpenAlexFDO

Authors Fang Tian, Zi-Long Liu

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)

Recommendations

• Probabilistic location problems with discrete demand weights
• The expropriation location problem
• Locating a semi-obnoxious facility with expropriation
• Location of Multiple Obnoxious Facilities
• A heuristic approach to the single facility maximin location problem

Cites work

• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• A general model for the undesirable single facility location problem
• A probabilistic minimax location problem on the plane
• Obnoxious Facility Location on Graphs
• Optimum Locations on a Graph with Probabilistic Demands
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• The expropriation location problem

Cited in

(3)

• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
• Maximizing the number of obnoxious facilities to locate within a bounded region
• Optimal facility location problem problem under possibility chance constraint conditions and barriers

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

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