activity
20232026
collaborators

5 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.CC2024

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.…

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…