Models and algorithms of semi-obnoxious facility location problems

MaRDI QIDQ3110244zbMATH OpenFDO

Authors Guo-Li Wang, Chao Yang, Zhi-Wei Liu, Dan-Dan Hu

Publication date 27 January 2012

zbMATH Keywords

heuristic algorithmlocationsemi-obnoxious facilities

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1340521
• The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
• Efficient location for a semi-obnoxious facility
• Semi-obnoxious single facility location in Euclidean space.
• A triobjective model for locating a public semiobnoxious facility in the plane

Cited in

(13)

• Semi-obnoxious location models: A global optimization approach
• Efficient location for a semi-obnoxious facility
• Semi-obnoxious single facility location in Euclidean space.
• A triobjective model for locating a public semiobnoxious facility in the plane
• The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
• Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
• Locating a semi-obnoxious facility in the special case of Manhattan distances
• On heuristic bi-criterion methods for semi-obnoxious facility location
• Locating a semi-obnoxious facility with expropriation
• scientific article; zbMATH DE number 1340521 (Why is no real title available?)
• A fractional model for locating semi-desirable facilities on networks
• Multiple obnoxious facility location: the case of protected areas
• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

This page was built for publication: Models and algorithms of semi-obnoxious facility location problems

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