1 citations · 1 across the 3 of their papers we have counts for
5 papers
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
Marcel Jackiewicz, Adam Kasperski, PaweÅ ZieliÅski
In this paper the recoverable robust shortest path problem is investigated. Discrete budgeted interval uncertainty representation is used to model uncertain second-stage arc costs.…
Single-item lot sizing problem under budgeted lead-time uncertainty
Romain Guillaume, Adam Kasperski, Szymon Wrobel +1
In this paper, a single-item lot sizing problem with backordering is discussed. The time horizon is divided into planning periods, characterized by fixed and variable production co…
Recoverable robust shortest path problem under interval budgeted uncertainty representations
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
In this paper, the recoverable robust shortest path problem under interval uncertainty representations is discussed. This problem is known to be strongly NP-hard and also hard to a…
An extension of Ordered Weighted Averaging over intervals with application to optimization under risk
Werner Baak, Marc Goerigk, Adam Kasperski +1
The Ordered Weighted Averaging (OWA) operator is a traditional and commonly used criterion for aggregating discrete values of uncertain quantities. In this paper, it is shown that…
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
Adam Kasperski, Pawel Zielinski
In this paper, the recoverable robust shortest path problem in acyclic digraphs is considered. The interval budgeted uncertainty representation is used to model the uncertain secon…