Paweł Zieliński

Wrocław University of Science and Technology — Poland

Decision Sciences · Social Sciences

24h-index1.8kcitations140works1.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Risk and Portfolio Optimization(65), Multi-Criteria Decision Making(63), Optimization and Mathematical Programming(41), Fuzzy Systems and Optimization(26), Supply Chain and Inventory Management(25)

Publications140 total

Computational complexity of the recoverable robust shortest path problem with discrete recourse
Discrete Applied Mathematics·2025· 2 cited
Solving Wasserstein Distributionally Robust Combinatorial Optimization Problems
Lecture notes in operations research·2025
Using the R* Criterion to Selected Optimization Problems Under Uncertainty
Lecture notes in operations research·2025
Solving the Recoverable Robust Shortest Path Problem in DAGs
Lecture notes in operations research·2025
Approximating the shortest path problem with scenarios
Theoretical Computer Science·2024· 1 cited
Robust min-max (regret) optimization using ordered weighted averaging
European Journal of Operational Research·2024· 5 cited
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
Networks·2024· 1 cited
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
arXiv (Cornell University)·2024· 1 citedOpen Access
Recoverable Possibilistic Linear Programming
2024
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
arXiv (Cornell University)·2024· 1 citedOpen Access
A framework of distributionally robust possibilistic optimization
Fuzzy Optimization and Decision Making·2024· 4 cited
Recoverable robust shortest path problem under interval budgeted uncertainty representations
arXiv (Cornell University)·2024Open Access
Lot Sizing Problem Under Lead-Time Uncertainty
Lecture notes in networks and systems·2024
Wasserstein robust combinatorial optimization problems
arXiv (Cornell University)·2023Open Access
Solving the recoverable robust shortest path problem in DAGs
arXiv (Cornell University)·2023Open Access
Robust Min-Max (Regret) Optimization using Ordered Weighted Averaging
arXiv (Cornell University)·2023Open Access
Robust optimization with belief functions
International Journal of Approximate Reasoning·2023· 4 citedOpen Access
Robust optimization with belief functions
arXiv (Cornell University)·2023Open Access
A framework of distributionally robust possibilistic optimization
arXiv (Cornell University)·2022Open Access
Distributionally robust possibilistic optimization problems
Fuzzy Sets and Systems·2022· 6 citedOpen Access
page 1 of 7Next →

Frequent Co-authors

Adam Kasperski(34), Stefan Chanas(6), Adam Kurpisz(5), Jérôme Fortin(5), Marc Goerigk(4), Didier Dubois(3), Romain Guillaume(3), Hélène Fargier(2), Mikita Hradovich(2), Didier Dubois(1), André Chassein(1), Caroline Thierry(1), M. Makuchowski(1), Krystyna Ziętak(1), André Chassein(1), Przemysław Kobylański(1), Beata Petkowicz(1), Piotrkowicz Jakub(1), Łukasz Szeszko(1), Katarzyna Banakiewicz(1)