activity
20082026
most citedA Robust Lot Sizing Problem with Ill-known Demands

13 citations · 24 across the 24 of their papers we have counts for

collaborators

30 papers

cs.DS2026

Recoverable robust representatives selection problem under interval continuous budgeted uncertainty

Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski

In this paper, the recoverable robust representative selection problem is considered, where uncertain second-stage costs are modeled using interval uncertainty with a continuous bu…

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.DS2024★ 1 cited

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs under interval budgeted uncertainty

Adam Kasperski, Marcel Jackiewicz, Pawel Zielinski

In this paper, we consider the recoverable robust shortest path problem in acyclic digraphs, employing interval budgeted uncertainty to model uncertain second-stage costs. For the…

cs.DS2024

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…

math.OC2023

Wasserstein robust combinatorial optimization problems

Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski

This paper discusses a class of combinatorial optimization problems with uncertain costs in the objective function. It is assumed that a sample of the cost realizations is availabl…

cs.DS2023

Solving the recoverable robust shortest path problem in DAGs

Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski

This paper deals with the recoverable robust shortest path problem under the interval uncertainty representation. The problem is known to be strongly NP-hard and not approximable i…