1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
Approximating the shortest path problem with scenarios
Adam Kasperski, Pawel Zielinski
This paper discusses the shortest path problem in a general directed graph with nodes and cost scenarios (objectives). In order to choose a solution, the min-max criterion…