Fast and Memory-Efficient Algorithms for Evacuation Problems

DOI10.1137/1.9781611974782.52zbMath1418.90061OpenAlexW4229841241MaRDI QIDQ4575790

Martin Skutella, Miriam Schlöter

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

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

Related Items (5)

The mixed evacuation problem ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Lexicographically optimal earliest arrival flows ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Discrete Newton methods for the evacuation problem

This page was built for publication: Fast and Memory-Efficient Algorithms for Evacuation Problems