Earliest arrival transshipments in networks with multiple sinks

DOI10.1007/978-3-030-17953-3_28zbMATH Open1436.90145OpenAlexW2942532007MaRDI QIDQ2293095FDOQ2293095

Authors: Miriam Schlöter 

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17953-3_28

Recommendations

• Earliest Arrival Flows with Multiple Sources
• Earliest arrival flows in networks with multiple sinks
• Earliest arrival flows in networks with multiple sinks
• Approximating Earliest Arrival Flows in Arbitrary Networks
• Fast and memory-efficient algorithms for evacuation problems

zbMATH Keywords

evacuationflows over timesubmodular function minimizationearliest arrival flowsearliest arrival transshipments

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (4)

• Approximating Earliest Arrival Flows in Arbitrary Networks
• Earliest arrival flows in networks with multiple sinks
• Earliest arrival flows in networks with multiple sinks
• Earliest Arrival Flows with Multiple Sources

This page was built for publication: Earliest arrival transshipments in networks with multiple sinks

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