Email: adam.kasperski@pwr.edu.pl

Unit: Faculty of Management (N) » Department of Operations Research and Business Intelligence

ul. I. Łukasiewicza 3/5, 50-371 Wrocław
building B-4, room 5.15

Office hours:

• Monday 1 p.m. - 3 p.m.
• Wednesday - 9 a.m. - 11 a.m.

Scientific interests

• Robust discrete optimization
• Approximation algorithms
• Applications of operations research

Teaching courses

---

1	Referat konferencyjny 2025 Romain Guillaume, Adam Kasperski, Szymon Wróbel, Paweł Zieliński, Using the R* criterion to selected optimization problems under uncertainty. W: Operations Research Proceedings 2024 : Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), Munich, Germany, September 3-6, 2024 / ed. Lukas Glomb. Cham : Springer Nature Switzerland AG, cop. 2025. s. 377-382. ISBN: 978-3-031-92575-7; 978-3-031-92574-0 Zasoby:DOIURL
2	Referat konferencyjny 2025 Marcel K Jackiewicz, Adam Kasperski, Paweł Zieliński, Solving the recoverable robust shortest path problem in DAGs. W: Operations Research Proceedings 2023 : Selected papers of the Annual International Conference of the German Operations Research Society (GOR), Germany, August 29 - September 1, 2023 / eds. Guido Voigt [i in.]. Cham : Springer Nature Switzerland AG, cop. 2025. s. 161-167. ISBN: 978-3-031-58404-6; 978-3-031-58405-3 Zasoby:DOIURL
3	Referat konferencyjny 2025 Marcel K Jackiewicz, Adam Kasperski, Paweł Zieliński, Solving Wasserstein distributionally robust combinatorial optimization problems. W: Operations Research Proceedings 2023 : Selected papers of the Annual International Conference of the German Operations Research Society (GOR), Germany, August 29 - September 1, 2023 / eds. Guido Voigt [i in.]. Cham : Springer Nature Switzerland AG, cop. 2025. s. 115-121. ISBN: 978-3-031-58404-6; 978-3-031-58405-3 Zasoby:DOIURL
4	Artykuł 2025 Marcel K Jackiewicz, Adam Kasperski, Paweł Zieliński, Computational complexity of the recoverable robust shortest path problem with discrete recourse. Discrete Applied Mathematics. 2025, vol. 370, s. 103-110. ISSN: 0166-218X; 1872-6771 Zasoby:DOIURLSFX
5	Artykuł 2025 Adam Kasperski, Paweł Zieliński, Approximating the shortest path problem with scenarios. Theoretical Computer Science. 2025, vol. 1025, art. 114972, s. 1-9. ISSN: 0304-3975; 1879-2294 Zasoby:DOISFX
6	Artykuł 2025 Werner Baak, Marc Goerigk, Adam Kasperski, Paweł Zieliński, Robust min-max (regret) optimization using ordered weighted averaging. European Journal of Operational Research. 2025, vol. 322, nr 1, s. 171-181. ISSN: 0377-2217; 1872-6860 Zasoby:DOISFX
7	Artykuł 2025 Marcel K Jackiewicz, Adam Kasperski, Paweł Zieliński, Recoverable robust shortest path problem under interval budgeted uncertainty representations. Networks. 2025, vol. 85, nr 1, s. 127-141. ISSN: 1097-0037; 0028-3045 Zasoby:DOISFX
8	Referat konferencyjny 2024 Romain Guillaume, Adam Kasperski, Paweł Zieliński, Lot sizing problem under lead-time uncertainty. W: Information Processing and Management of Uncertainty in Knowledge-Based Systems : 20th International Conference, IPMU 2024, Lisbon, Portugal, July 22-26, 2024 : proceedings. Vol. 1 / eds. Marie-Jeanne Lesot [i in.]. Cham : Springer, cop. 2024. s. 138-149. ISBN: 978-3-031-74002-2; 978-3-031-74003-9 Zasoby:DOISFX
9	Referat konferencyjny 2024 Adam Kasperski, Paweł Zieliński, Recoverable possibilistic linear programming. W: FUZZ-IEEE 2024 : conference proceedings. Danvers, MA : IEEE, cop. 2024. s. 1-8. ISBN: 979-8-3503-1954-5 Zasoby:DOI
10	Artykuł 2024 Romain Guillaume, Adam Kasperski, Paweł Zieliński, A framework of distributionally robust possibilistic optimization. Fuzzy Optimization and Decision Making. 2024, vol. 23, s. 253-278. ISSN: 1568-4539; 1573-2908 Zasoby:DOISFX