Robust mean absolute deviation problems on networks with linear vertex weights
From MaRDI portal
Recommendations
- Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
- New approaches to the robust 1-center location problems on tree networks
- Robust location problems with pos/neg weights on a tree
- Robust facility location
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
Cites work
- A note on the minmax regret centdian location on trees
- A note on the robust 1-center problem on trees
- Algorithms for the robust 1-center problem on a tree
- An improved algorithm for the minmax regret median problem on a tree
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Conditional median as a robust solution concept for uncapacitated location problems
- Equity Maximizing Facility Location Schemes
- Equity measurement in facility location analysis: A review and framework
- scientific article; zbMATH DE number 1253048 (Why is no real title available?)
- scientific article; zbMATH DE number 1279217 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- Improved algorithms for several network location problems with equality measures.
- Inequality measures and equitable locations
- Interval data minmax regret network optimization problems
- Minimax regret p-center location on a network with demand uncertainty
- Minimax regret path location on trees
- Minimax regret single-facility ordered median location problems on networks
- Minmax regret location--allocation problem on a network under uncertainty
- Minmax Regret Median Location on a Network Under Uncertainty
- Minmax-regret robust 1-median location on a tree
- On Parametric Medians of Trees
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Robust location problems with pos/neg weights on a tree
- Technical Note—On the Complexity of Some Classes of Location Problems
- The minmax relative regret median problem on networks
Cited in
(5)- Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
- Minmax regret maximal covering location problems with edge demands
- Inequity averse optimization in operational research
- A parallelized lagrangean relaxation approach for the discrete ordered median problem
- Mathematical optimization models for reallocating and sharing health equipment in pandemic situations
This page was built for publication: Robust mean absolute deviation problems on networks with linear vertex weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326780)
