Search Results - subject:"Robust shortest paths"

Algorithms and uncertainty sets for data-driven robust shortest path problems

Chassein, André; Dokka, Trivikram; Goerigk, Marc - In: European journal of operational research : EJOR 274 (2019) 2, pp. 671-686

Persistent link: https://www.econbiz.de/10011990186

A double oracle approach to minmax regret optimization problems with interval data

Gilbert, Hugo; Spanjaard, Olivier - In: European journal of operational research : EJOR 262 (2017) 3, pp. 929-943

Persistent link: https://www.econbiz.de/10011802305

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem

Chassein, André B.; Goerigk, Marc - In: European Journal of Operational Research 244 (2015) 3, pp. 739-747

Minmax regret optimization aims at finding robust solutions that perform best in the worst-case, compared to the respective optimum objective value in each scenario. Even for simple uncertainty sets like boxes, most polynomially solvable optimization problems have strongly NP-complete minmax...

Persistent link: https://www.econbiz.de/10011264336

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem

Chassein, André B.; Goerigk, Marc - In: European journal of operational research : EJOR 244 (2015) 3, pp. 739-747

Persistent link: https://www.econbiz.de/10011289946