Narrow search
Showing 1 - 5 of 5
Cover Image
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
Cover Image
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
Cover Image
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
Cover Image
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
Cover Image
Complexity of strict robust integer minimum cost flow problems : an overview and further results
Chassein, André; Kinscherff, Anika - In: Computers & operations research : and their … 104 (2019), pp. 228-238
Persistent link: https://www.econbiz.de/10011991226