Minsum \(k\)-sink problem on dynamic flow path networks
From MaRDI portal
Publication:1670987
DOI10.1007/978-3-319-94667-2_7zbMath1442.90023OpenAlexW2811100331MaRDI QIDQ1670987
Tsunehiko Kameda, Naoki Katoh, Yuya Higashikawa, Robert Benkoczi, Binay K. Bhattacharya
Publication date: 6 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-94667-2_7
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (6)
Capacity provisioning for evacuation on path networks ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Unnamed Item ⋮ Minsum \(k\)-sink problem on path networks ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
This page was built for publication: Minsum \(k\)-sink problem on dynamic flow path networks
