Multiple Sink Location Problems in Dynamic Path Networks

DOI10.1007/978-3-319-07956-1_14zbMath1445.68109arXiv1405.5613OpenAlexW1590233173MaRDI QIDQ5251641

Yuya Higashikawa, Naoki Katoh, Mordecai J. Golin

Publication date: 20 May 2015

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

Full work available at URL: https://arxiv.org/abs/1405.5613

zbMATH Keywords

sink locationdynamic networkevacuation planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items (5)

Multiple sink location problem in path networks with a combinational objective ⋮ Minimax regret 1-sink location problem with accessibility in dynamic general networks ⋮ Multiple sink location problems in dynamic path networks ⋮ Minimax regret 1-sink location problem in dynamic cycle networks ⋮ Minimax regret 1-median problem in dynamic path networks

This page was built for publication: Multiple Sink Location Problems in Dynamic Path Networks