Minsum k-sink problem on dynamic flow path networks

DOI10.1007/978-3-319-94667-2_7MaRDI QIDQ1670987zbMATH OpenOpenAlexFDO

Authors Robert Benkoczi, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Binay Bhattacharya

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94667-2_7

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Recommendations

• Minsum \(k\)-sink problem on path networks
• Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
• Multiple sink location problems in dynamic path networks
• Multiple sink location problems in dynamic path networks
• Improved algorithms for computing \(k\)-sink on dynamic flow path networks

Cited in

(13)

• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
• Minsum \(k\)-sink problem on path networks
• Minmax regret k-sink location on a dynamic path network with uniform capacities
• Improved algorithms for computing \(k\)-sink on dynamic flow path networks
• Sink location to find optimal shelters in evacuation planning
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
• Multiple sink location problems in dynamic path networks
• Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
• Capacity provisioning for evacuation on path networks
• Locating evacuation centers optimally in path and cycle networks
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
• Multiple sink location problems in dynamic path networks

This page was built for publication: Minsum \(k\)-sink problem on dynamic flow path networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670987)