| Recoverable robust spanning tree problem under interval uncertainty representations M Hradovich, A Kasperski, P Zieliński Journal of Combinatorial Optimization 34, 554-573, 2017 | 18 | 2017 |
| The recoverable robust spanning tree problem with interval costs is polynomially solvable M Hradovich, A Kasperski, P Zieliński Optimization Letters 11, 17-30, 2017 | 13 | 2017 |
| Robust recoverable 0–1 optimization problems under polyhedral uncertainty M Hradovich, A Kasperski, P Zieliński European Journal of Operational Research 278 (1), 136-148, 2019 | 2 | 2019 |
| Risk averse scheduling with scenarios M Hradovich, A Kasperski, P Zieliński Operations Research Proceedings 2017: Selected Papers of the Annual …, 2018 | 2 | 2018 |
| The robust recoverable spanning tree problem with interval costs is polynomially solvable M Hradovich, A Kasperski, P Zielinski arXiv preprint arXiv:1602.07422, 2016 | 2 | 2016 |
| Recoverable Robust Discrete Optimization Problems under Interval Uncertainty Representation M Hradovich | | |
Pawel ZielinskiDepartment of Fundamentals of Computer Science, Wrocław University of Technology, Wroclaw, PolandVerified email at pwr.edu.pl
