Semi-obnoxious single facility location in Euclidean space.
From MaRDI portal
Publication:1422376
DOI10.1016/S0305-0548(02)00140-5zbMath1039.90030MaRDI QIDQ1422376
Emanuel Melachrinoudis, Zaharias Xanthopulos
Publication date: 14 February 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)
Related Items (18)
Inequity averse optimization in operational research ⋮ Solving the semi-desirable facility location problem using bi-objective particle swarm ⋮ Review of obnoxious facilities location problems ⋮ A bi-objective modeling approach applied to an urban semi-desirable facility location problem ⋮ The multicriteria big cube small cube method ⋮ 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 ⋮ New models for the location of controversial facilities: a bilevel programming approach ⋮ 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 ⋮ On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) ⋮ Multiple criteria facility location problems: a survey ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ Efficiency for continuous facility location problems with attraction and repulsion ⋮ Computing obnoxious 1-corner polygonal chains ⋮ 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
- A multiobjective model for locating undesirable facilities
- A single facility location problem with a weighted maximin-minimax rectilinear distance
- Multiobjective programming and planning
- Some personal views on the current state and the future of locational analysis
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- A Maxmin Location Problem
- Local convergence in Fermat's problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- A multiobjective model for the dynamic location of landfills
- A model to assess risk, equity and efficiency in facility location and transportation of hazardous materials
- Link-Length Minimization in Networks
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
- A note on Fermat's problem
This page was built for publication: Semi-obnoxious single facility location in Euclidean space.
