Minimax Regret 1-Sink Location Problems in Dynamic Path Networks

DOI10.1007/978-3-642-38236-9_12zbMath1302.90101MaRDI QIDQ4922120

Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Siu-Wing Cheng, Bing Su, Yin-Feng Xu

Publication date: 28 May 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_12

zbMATH Keywords

minimax regret; sink location; path networks; evacuation problem; dynamic flow

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68W40: Analysis of algorithms

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Related Items

Unnamed Item, Minimax regret vertex 2-sink location problem in dynamic path networks, Minmax regret 1-facility location on uncertain path networks, Minimax regret 1-sink location problem with accessibility in dynamic general networks, Minimax regret 1-sink location problem in dynamic cycle networks, Minimax regret 1-median problem in dynamic path networks, Multiple sink location problem in path networks with a combinational objective, Improved algorithms for computing minmax regret sinks on dynamic path and tree networks, Multiple sink location problems in dynamic path networks, Minmax regret for sink location on dynamic flow paths with general capacities, Minsum \(k\)-sink problem on path networks, Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities, Minimax regret 1-sink location problem in dynamic path networks