Fast and memory-efficient algorithms for evacuation problems

DOI10.1137/1.9781611974782.52MaRDI QIDQ4575790zbMATH OpenOpenAlexFDO

Authors Miriam Schlöter, Martin Skutella

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974782.52

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1003275
• Faster algorithms for the quickest transshipment problem
• The quickest transshipment problem
• On solving quickest time problems in time-dependent, dynamic networks
• scientific article; zbMATH DE number 910909

Cited in

(13)

• The mixed evacuation problem
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• Earliest arrival transshipments in networks with multiple sinks
• Discrete Newton methods for the evacuation problem
• Network aggregation and flows with applications to evacuation planning
• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• Lexicographically optimal earliest arrival flows
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
• Minimum-peak-cost flows over time
• The minimum-cost dynamic flow problem in a fixed graph with a constant target flow value
• An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths

This page was built for publication: Fast and memory-efficient algorithms for evacuation problems

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