Name
Abstract | ||
|---|---|---|
•We consider robust shortest path problems with real-world street data.•Different uncertainty sets for data-driven robust optimisation are compared.•Trade-offs between uncertainty sets are identified.•A new branch-and-bound algorithm for ellipsoidal uncertainty is proposed. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejor.2018.10.006 | European Journal of Operational Research |
Keywords | Field | DocType |
Robustness and sensitivity analysis,Robust shortest paths,Uncertainty sets,Data-driven robust optimization | Ellipsoid,Mathematical optimization,Data-driven,Shortest path problem,Robust optimization,Algorithm,Solver,Mathematics | Journal |
Volume | Issue | ISSN |
274 | 2 | 0377-2217 |
Citations | PageRank | References |
1 | 0.35 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| André B. Chassein | 1 | 56 | 7.80 |
| Trivikram Dokka | 2 | 19 | 5.33 |
| Marc Goerigk | 3 | 72 | 14.77 |