Minimax Regret k-sink Location Problem in Dynamic Path Networks

DOI10.1007/978-3-319-07956-1_3zbMath1445.90016OpenAlexW2133046558MaRDI QIDQ5251631

Guanqun Ni, Yucheng Dong, Yin-Feng Xu

Publication date: 20 May 2015

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07956-1_3

zbMATH Keywords

minimax regretpath networksevacuation problemdynamic flow\(k\)-sink location

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

Multiple sink location problem in path networks with a combinational objective ⋮ Minmax regret 1-facility location on uncertain path 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 ⋮ Minimax regret 1-sink location problem in dynamic cycle networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities