Robustness in the Pareto-solutions for the multi-criteria minisum location problem
From MaRDI portal
Publication:4329625
DOI10.1002/mcda.303zbMath0995.90044OpenAlexW2134322429MaRDI QIDQ4329625
Stefan Nickel, Antonio M. Rodríguez-Chía, Justo Puerto, Francisco Ramón Fernández García
Publication date: 1 May 2002
Published in: Journal of Multi-Criteria Decision Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mcda.303
Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80)
Related Items
A geometric characterisation of the quadratic min-power centre ⋮ On the planar piecewise quadratic 1-center problem ⋮ Conditional median as a robust solution concept for uncapacitated location problems ⋮ The multiscenario lot size problem with concave costs. ⋮ Facility location problems with uncertainty on the plane ⋮ Robustness in Multi-criteria Decision Aiding ⋮ Minimax regret path location on trees ⋮ Multicriteria planar ordered median problems
Cites Work
- Unnamed Item
- Unnamed Item
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Multicriteria planar location problems
- A geometrical solution for quadratic bicriteria location models
- Efficiency in Euclidean constrained location problems
- On the number of criteria needed to decide Pareto optimality
- General models in min-max planar location: Checking optimality conditions
- Algorithms for Reporting and Counting Geometric Intersections
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
