Similar Search Results

Narrow search

Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion

Kasperski, Adam; Zieliński, Paweł - In: Operations research letters 41 (2013) 6, pp. 639-643

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

Approximability of the robust representatives selection problem

Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł - In: Operations research letters 43 (2015) 1, pp. 16-19

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

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

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty

Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł - In: European Journal of Operational Research 217 (2012) 1, pp. 36-43

This paper deals with the two machine permutation flow shop problem with uncertain data, whose deterministic counterpart is known to be polynomially solvable. In this paper, it is assumed that job processing times are uncertain and they are specified as a discrete scenario set. For this...

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