Fast robust shortest path computations

DOI10.4230/OASICS.ATMOS.2018.5MaRDI QIDQ6594064FDOQ6594064

Authors: Christoph Hansknecht, Alexander Richter, Sebastian Stiller 

Publication date: 27 August 2024

Recommendations

• On the robust shortest path problem.
• An experimental comparison of uncertainty sets for robust shortest path problems
• An exact algorithm for the robust shortest path problem with interval data
• Robust shortest path problems
• The minmax regret robust shortest path problem in a finite multi-scenario model

zbMATH Keywords

shortest pathsgraph algorithmsrobust optimization

Mathematics Subject Classification ID

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

Cited In (2)

• Benchmarking problems for robust discrete optimization
• An experimental comparison of uncertainty sets for robust shortest path problems

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)