Fast robust shortest path computations

DOI10.4230/OASICS.ATMOS.2018.5MaRDI QIDQ6594064

Alexander T. Richter, Sebastian Stiller, Christoph Hansknecht

Publication date: 27 August 2024

zbMATH Keywords

shortest pathsgraph algorithmsrobust optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Robustness in mathematical programming (90C17)

Related Items (1)

Benchmarking problems for robust discrete optimization

This page was built for publication: Fast robust shortest path computations

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