Similar Search Results

Robust discrete optimization under discrete and interval uncertainty : a survey

Kasperski, Adam; Zieliński, Paweł - In: Robustness analysis in decision aiding, optimization, …, (pp. 113-143). 2016

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

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

Robust recoverable 0-1 optimization problems under polyhedral uncertainty

Hradovich, Mikita; Kasperski, Adam; Zieliński, Paweł - In: European journal of operational research : EJOR 278 (2019) 1, pp. 136-148

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

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

Risk-averse single machine scheduling : complexity and approximation

Kasperski, Adam; Zieliński, Paweł - In: Journal of scheduling 22 (2019) 5, pp. 567-580

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

A framework of distributionally robust possibilistic optimization

Guillaume, Romain; Kasperski, Adam; Zieliński, Paweł - In: Fuzzy optimization and decision making : a journal of … 23 (2024) 2, pp. 253-278

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

Robust material requirement planning with cumulative demand under uncertainty

Guillaume, Romain; Thierry, Caroline; Zieliński, Paweł - In: International journal of production research 55 (2017) 22, pp. 6824-6845

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

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

Propagation of waves and chaos in transmission line with strongly anharmonic dangling resonator

Zieliński, P.; Kułak, A.; Dobrzyński, L.; … - In: The European Physical Journal B - Condensed Matter and … 32 (2003) 1, pp. 73-79

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

On two single machine scheduling problems with fuzzy processing times and fuzzy due dates

Chanas, Stefan; Kasperski, Adam - In: European Journal of Operational Research 147 (2003) 2, pp. 281-296

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