Minmax regret 1-facility location on uncertain path networks
From MaRDI portal
Publication:297369
DOI10.1016/j.ejor.2014.06.026zbMath1339.90202OpenAlexW1982820819MaRDI QIDQ297369
Publication date: 27 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.06.026
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items
Multiple sink location problem in path networks with a combinational objective ⋮ Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Computing the Center of Uncertain Points on Tree Networks ⋮ Minimax regret 1-sink location problem with accessibility in dynamic general networks ⋮ Improved algorithms for computing minmax regret sinks on dynamic path and tree networks ⋮ The two-center problem of uncertain points on a real line ⋮ One-dimensional \(k\)-center on uncertain data ⋮ Computing the center of uncertain points on tree networks ⋮ A note on computing the center of uncertain data on the real line ⋮ Covering uncertain points in a tree ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
Cites Work
- Minmax regret location--allocation problem on a network under uncertainty
- A note on the minmax regret centdian location on trees
- Making data structures persistent
- Robust discrete optimization and its applications
- Algorithms for the robust 1-center problem on a tree
- Facility location problems with uncertainty on the plane
- Minmax Regret 1-Facility Location on Uncertain Path Networks
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- 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
- Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights
- Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- Minimax Regret k-sink Location Problem in Dynamic Path Networks
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
