3 papers
cs.DS2026
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…
cs.DS2026
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…
cs.DS2025
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…