Similar Search Results

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

On recoverable and two-stage robust selection problems with budgeted uncertainty

Chassein, André; Goerigk, Marc; Kasperski, Adam; … - In: European journal of operational research : EJOR 265 (2018) 2, pp. 423-436

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

The quadratic shortest path problem : complexity, approximability, and solution methods

Rostami, Borzou; Chassein, André; Hopf, Michael; Frey, … - In: European journal of operational research : EJOR 268 (2018) 2, pp. 473-485

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

Ranking robustness and its application to evacuation planning

Goerigk, Marc; Hamacher, Horst W.; Kinscherff, Anika - In: European journal of operational research : EJOR 264 (2018) 3, pp. 837-846

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

Generating hard instances for robust combinatorial optimization

Goerigk, Marc; Maher, Stephen J. - In: European journal of operational research : EJOR 280 (2020) 1, pp. 34-45

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

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty

Chassein, André; Goerigk, Marc; Kurtz, Jannis; Poss, … - In: European journal of operational research : EJOR 279 (2019) 2, pp. 308-319

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

Approximating combinatorial optimization problems with the ordered weighted averaging criterion

Chassein, André; Goerigk, Marc; Kasperski, Adam; … - In: European journal of operational research : EJOR 286 (2020) 3, pp. 828-838

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

Recoverable robust representatives selection problems with discrete budgeted uncertainty

Goerigk, Marc; Lendl, Stefan; Wulf, Lasse - In: European journal of operational research : EJOR 303 (2022) 2, pp. 567-580

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

Multi-level bottleneck assignment problems : complexity and sparsity-exploiting formulations

Dokka, Trivikram; Goerigk, Marc - In: Computers & operations research : and their … 154 (2023), pp. 1-12

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