Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk).

DOI10.4230/lipics.esa.2021.1OpenAlexW3198763260MaRDI QIDQ6075885

Frauke Liers, Florian Rösel, Lukas Glomb, Unnamed Author

Publication date: 20 September 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/14582/pdf/LIPIcs-ESA-2021-1.pdf/

zbMATH Keywords

complexityapproximationrolling-horizonnetwork problems over time

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk).