Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

DOI10.1007/978-3-319-04657-0_14zbMath1302.90103OpenAlexW87200583MaRDI QIDQ5746252

Yuya Higashikawa, Naoki Katoh, Mordecai J. Golin

Publication date: 18 February 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_14

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 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 ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Multiple sink location problems in dynamic path networks ⋮ Capacity provisioning for evacuation on path networks ⋮ Minimax regret 1-sink location problem in dynamic cycle networks ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities

This page was built for publication: Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity