An experimental comparison of uncertainty sets for robust shortest path problems

DOI10.4230/OASICS.ATMOS.2017.16MaRDI QIDQ6571024zbMATH OpenFDO

Authors Trivikram Dokka, Marc Goerigk

Publication date 11 July 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2017.16

zbMATH Keywords

experimental studyreal-world datarobust shortest pathsuncertainty sets

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• Algorithms and uncertainty sets for data-driven robust shortest path problems
• Fast robust shortest path computations
• New models for the robust shortest path problem: complexity, resolution and generalization
• On the robust shortest path problem.
• A note on different modelling approaches for the robust shortest path problem

Cited in

(1)

• Fast robust shortest path computations

This page was built for publication: An experimental comparison of uncertainty sets for robust shortest path problems

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