Conditional median as a robust solution concept for uncapacitated location problems
From MaRDI portal
Publication:611014
DOI10.1007/s11750-009-0101-8zbMath1201.90122OpenAlexW2020415949MaRDI QIDQ611014
Publication date: 13 December 2010
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-009-0101-8
Minimax problems in mathematical programming (90C47) Sensitivity, stability, parametric optimization (90C31) Discrete location and assignment (90B80)
Related Items (5)
Robust mean absolute deviation problems on networks with linear vertex weights ⋮ Optimizing ordered median functions with applications to single facility location ⋮ Range minimization problems in path-facility location on trees ⋮ Minimax regret path location on trees ⋮ Minimax regret 1-sink location problem in dynamic path networks
Cites Work
- Unnamed Item
- Unnamed Item
- About the applicability of MCDA to some robustness problems
- Inequality measures and equitable locations
- Some new algorithms for location problems on networks
- Equity measurement in facility location analysis: A review and framework
- Robust discrete optimization and its applications
- Inequality measures and equitable approaches to location problems
- Minimizing the sum of the \(k\) largest functions in linear time.
- Conditional median: a parametric solution concept for location problems
- Equitable aggregations and multiple criteria analysis
- A decision-theoretic approach to robust optimization in multivalued graphs
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks
- Location Theory
- Future Challenges
- Centers to centroids in graphs
- Robustness in the Pareto-solutions for the multi-criteria minisum location problem
- Linear optimization with multiple equitable criteria
- Dual Stochastic Dominance and Quantile Risk Measures
- The \(k\)-centrum multi-facility location problem
This page was built for publication: Conditional median as a robust solution concept for uncapacitated location problems
