Showing 2023Show all
2 papers · 1 filter
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…