Probabilistic single obnoxious facility location with fixed budget

DOI10.1016/J.IPL.2011.09.001zbMATH Open1236.90069OpenAlexW1974936762MaRDI QIDQ413284FDOQ413284

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Obnoxious Facility Location on Graphs
• The expropriation location problem
• A probabilistic minimax location problem on the plane
• A general model for the undesirable single facility location problem
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• Optimum Locations on a Graph with Probabilistic Demands

Cited In (2)

• 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

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)