Undesirable facility location problems on multicriteria networks
From MaRDI portal
Publication:853902
DOI10.1016/j.cor.2005.06.010zbMath1102.90009OpenAlexW1989780079MaRDI QIDQ853902
Joaquín Sicilia, Marcos Colebrook
Publication date: 7 December 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.06.010
Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Analytical models for locating undesirable facilities
- A multiobjective programming model for locating treatment sites and routing hazardous wastes
- An \(O(mn)\) algorithm for the 1-maximin problem on a network
- A note on the location of an obnoxious facility on a network
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- Obnoxious Facility Location on Graphs
- A new algorithm for the undesirable 1-center problem on networks
- A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function
- The maximin-maxisum network location problem
This page was built for publication: Undesirable facility location problems on multicriteria networks