A triobjective model for locating a public semiobnoxious facility in the plane
From MaRDI portal
Publication:1666194
DOI10.1155/2015/631872zbMath1394.90387OpenAlexW1573169777WikidataQ59119184 ScholiaQ59119184MaRDI QIDQ1666194
Juana L. Redondo, Pilar M. Ortigosa, José-Jesús Fernández, Aránzazu Gila Arrondo
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/631872
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
- Equitable service by a facility: minimizing the Gini coefficient
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Multiple criteria facility location problems: a survey
- Analytical models for locating undesirable facilities
- Multicriteria planar location problems
- Semi-obnoxious location models: A global optimization approach
- Equity measurement in facility location analysis: A review and framework
- Efficient location for a semi-obnoxious facility
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Minimization by Random Search Techniques
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Evolutionary Multi-Criterion Optimization
- Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
This page was built for publication: A triobjective model for locating a public semiobnoxious facility in the plane
