Minimax regret 1-median problem in dynamic path networks
From MaRDI portal
Publication:726099
DOI10.1007/s00224-017-9783-8zbMath1397.90236arXiv1509.07600OpenAlexW2949692692MaRDI QIDQ726099
Shun Saburi, Naoki Katoh, Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda
Publication date: 3 August 2018
Published in: Lecture Notes in Computer Science, Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07600
Cooperative games (91A12) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (3)
Multiple sink location problem in path networks with a combinational objective ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Unnamed Item
Cites Work
- A linear time algorithm for computing minmax regret 1-median on a tree network
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Multiple sink location problems in dynamic path networks
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
- A note on the minmax regret centdian location on trees
- Algorithms for the robust 1-center problem on a tree
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- Minimax regret 1-sink location problem in dynamic path networks
- Minmax Regret 1-Facility Location on Uncertain Path Networks
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Minmax-regret robust 1-median location on a tree
- Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
- Multiple Sink Location Problems in Dynamic Path Networks
- Constructing Maximal Dynamic Flows from Static Flows
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
This page was built for publication: Minimax regret 1-median problem in dynamic path networks
