Prof. dr hab. inż. Adam Kasperski
Professor of Computer Science
Faculty of ManagementWrocław University of Science and TechnologyWybrzeże Wyspiańskiego 2750-370 Wrocław, POLANDRoom 515 B4
Editor of Operations Research and Decisions
e-mail: adam.kasperski [at] pwr.edu.pl
contact hours:
Research interests:
Robust optimization
Approximation algorithms
Operations research
Recent preprints (2023-2024):
M. Jackiewicz, A. Kasperski, P. Zieliński. Wasserstein robust combinatorial optimization problems. arXiv:2312.12769v
M. Jackiewicz, A. Kasperski, P. Zieliński. Recoverable robust shortest path problem under interval uncertainty representations. arXiv:2401.05715v1
W. Baak, M. Goerigk, A. Kasperski, P. Zieliński. Robust min-max (regret) optimization using ordered weighted averaging. arXiv:2308.08522v2
Recent journal papers:
R.Guillaume, A. Kasperski, P. Zieliński. A framework of distributionally robust possibilitic optimization. Fuzzy Optimization and Decision Making, to appear
R. Guillaume, M. Goerigk, A. Kasperski, P. Zieliński. Robust optimization with belief functions. International Journal of Approximate Reasonning 159, 108941, 2023
R.Guillaume, A. Kasperski, P. Zieliński. Distributionally robust possibilistic optimization problems. Fuzzy Sets and Systemts 454, 56-73, 2023
R.Guillaume, A. Kasperski, P. Zieliński. Robust inventory problem with cumulative demand uncertainty. Optimization Letters 16, 2543-2556, 2022
M. Goerigk, A. Kasperski, P. Zieliński. Robust two-stage combinatorial optimization problems under convex uncertainty. Journal of Combinatorial Optimization 43, 497-527, 2022
M. Goerigk, A. Kasperski, P. Zieliński. Cominatorial two-stage minmax regret problems under interval uncertainty. Annals of Operations Research 300, 23-50, 2021
A. Kasperski, P. Zieliński. Soft robust solutions to possibilistic optimization problems. Fuzzy Sets and Systems 422, 130-148, 2021
M. M. Goerigk, A. Kasperski, P. Zieliński. Two-stage combiatorial optimization problems under risk. Theoretical Computer Science 804, 29-45, 2020
A. Chassein, M. Goerigk, A. Kasperski, P. Zieliński. Approximating combinatorial optimization problems with the ordered weighted averaging criterion. European Journal of Operational Research 286, 828-838, 2020
M. Hradovich, A. Kasperski, P. Zieliński. Robust recoverable 0-1 optimization problems under polyhedral uncertainty. European Journal of Operational Research 278, 136-148, 2019
A. Kasperski, P. Zieliński. Risk averse single machine scheduling: complexity and approximation. Journal of Scheduling 22, 567-580, 2019
A. Chassein, M. Goerigk, A. Kasperski, P. Zieliński. On recoverable and two-stage robust selection problems with budgeted uncertainty. European Journal of Operational Research 265, 423-436, 2018
A. Kasperski, P. Zieliński. Robust recoverable and two-stage selection problems. Discrete Applied Mathematics 233, 52-64, 2017.
M. Hradovich, A. Kasperski, P. Zieliński. Recoverable robust spanning tree problem under interval uncertatinty representations. Journal of Combinatorial Optimization 34, 554-573, 2017.
M. Hradovich, A. Kasperski, P. Zieliński. The recoverable robust spanning tree problem with interval costs is polynomially solvable. Optimization Letters 11, 17-30, 2017.
A. Kasperski, P. Zieliński. Single machine scheduling problems with uncertain parameters and the OWA criterion. Journal of Scheduling 19, 177-190, 2016
A. Kasperski, P. Zieliński. Using the WOWA operator in robust discrete optimization problems. International Journal of Approximate Reasoning 68, 54-67, 2016