The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation

DOI10.1016/S0377-2217(02)00271-0zbMath1037.90043OpenAlexW2006896692MaRDI QIDQ1869670

Anders J. V. Skriver, Kim Allan Andersen

Publication date: 28 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00271-0

zbMATH Keywords

locationMultiple criteria analysisplanar networkssemi-obnoxious

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (17)

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ Undesirable facility location problems on multicriteria networks ⋮ Solving the semi-desirable facility location problem using bi-objective particle swarm ⋮ A triobjective model for locating a public semiobnoxious facility in the plane ⋮ A bi-objective modeling approach applied to an urban semi-desirable facility location problem ⋮ The multicriteria big cube small cube method ⋮ Unnamed Item ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Dispersion with connectivity in wireless mesh networks ⋮ OR models in urban service facility location: a critical review of applications and future developments ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ An interactive solution approach for a bi-objective semi-desirable location problem ⋮ Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives ⋮ Multiple criteria facility location problems: a survey ⋮ Efficiency for continuous facility location problems with attraction and repulsion ⋮ The Location of Undesirable Facilities ⋮ On heuristic bi-criterion methods for semi-obnoxious facility location

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytical models for locating undesirable facilities
• GBSSS: The generalized big square small square method for planar single- facility location
• Multicriteria optimization
• An empirical investigation of some bicriterion shortest path algorithms
• A label correcting approach for solving bicriterion shortest-path problems
• The Minisum and Minimax Location Problems Revisited
• On locating a semi-desirable facility on the continuous plane

This page was built for publication: The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation