Locating evacuation centers optimally in path and cycle networks

DOI10.4230/OASICS.ATMOS.2021.13MaRDI QIDQ6587291zbMATH OpenFDO

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

Publication date 13 August 2024

zbMATH Keywords

facility locationefficient algorithmsevacuation problemdynamic flow in networkminmax sink

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

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

Cited in

(3)

• Sink location problems in dynamic flow grid networks
• Capacity provisioning for evacuation on path networks
• Sink location problems in dynamic flow grid networks

This page was built for publication: Locating evacuation centers optimally in path and cycle networks

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