Minimax regret 1-sink location problem in dynamic path networks

DOI10.1016/j.tcs.2014.02.010zbMath1326.90044OpenAlexW2066560026MaRDI QIDQ2348257

Bing Su, Guanqun Ni, Yuya Higashikawa, Siu-Wing Cheng, John E. Augustine, Mordecai J. Golin, Yin-Feng Xu, Naoki Katoh

Publication date: 11 June 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.010

zbMATH Keywords

minimax regretsink locationevacuation planningdynamic flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (10)

Multiple sink location problem in path networks with a combinational objective ⋮ Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minimax regret 1-sink location problem with accessibility in dynamic general networks ⋮ Multiple sink location problems in dynamic path networks ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Unnamed Item ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Minsum \(k\)-sink problem on path networks ⋮ Minimax regret vertex 2-sink location problem in dynamic path networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities

Cites Work

• Conditional median as a robust solution concept for uncapacitated location problems
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Minmax regret location--allocation problem on a network under uncertainty
• 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
• Robust discrete optimization and its applications
• Algorithms for the robust 1-center problem on a tree
• 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
• Minmax-regret robust 1-median location on a tree
• Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
• Constructing Maximal Dynamic Flows from Static Flows

This page was built for publication: Minimax regret 1-sink location problem in dynamic path networks