An interactive solution approach for a bi-objective semi-desirable location problem
From MaRDI portal
Publication:960111
DOI10.1007/s10898-007-9237-yzbMath1160.90557OpenAlexW2058449285MaRDI QIDQ960111
Deniz Nadirler, Esra Köktener Karasakal
Publication date: 16 December 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9237-y
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Management decision making, including multiple objectives (90B50)
Related Items
Higher and lower-level knowledge discovery from Pareto-optimal sets ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives ⋮ Multiple criteria facility location problems: a survey ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- A visual interactive method for solving the multiple criteria problem
- A single facility location problem with a weighted maximin-minimax rectilinear distance
- A reference direction approach to multiple objective integer linear programming
- GBSSS: The generalized big square small square method for planar single- facility location
- Semi-obnoxious location models: A global optimization approach
- Semi-obnoxious single facility location in Euclidean space.
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- Interactive outranking approaches for multicriteria decision-making problems with imprecise information
- An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
- On locating a semi-desirable facility on the continuous plane
- Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?
- Rectilinear Location Revisited
- Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance
