Robust mean absolute deviation problems on networks with linear vertex weights
From MaRDI portal
Publication:5326780
DOI10.1002/net.21471zbMath1269.90022OpenAlexW2115166845WikidataQ58217162 ScholiaQ58217162MaRDI QIDQ5326780
Antonio M. Rodríguez-Chía, M. C. López-de-los-Mozos, Justo Puerto
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/89931
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10)
Related Items (5)
Inequity averse optimization in operational research ⋮ Minmax regret maximal covering location problems with edge demands ⋮ Mathematical optimization models for reallocating and sharing health equipment in pandemic situations ⋮ Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights ⋮ A parallelized lagrangean relaxation approach for the discrete ordered median problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional median as a robust solution concept for uncapacitated location problems
- Minmax regret location--allocation problem on a network under uncertainty
- A note on the minmax regret centdian location on trees
- Inequality measures and equitable locations
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Equity measurement in facility location analysis: A review and framework
- Improved algorithms for several network location problems with equality measures.
- Algorithms for the robust 1-center problem on a tree
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Interval data minmax regret network optimization problems
- A note on the robust 1-center problem on trees
- Robust location problems with pos/neg weights on a tree
- The Minmax Relative Regret Median Problem on Networks
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks
- Minimax regret path location on trees
- Equity Maximizing Facility Location Schemes
- On Parametric Medians of Trees
- Technical Note—On the Complexity of Some Classes of Location Problems
- Minimax regret p-center location on a network with demand uncertainty
- Minmax-regret robust 1-median location on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- An improved algorithm for the minmax regret median problem on a tree
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Robust mean absolute deviation problems on networks with linear vertex weights
