4 papers
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…
Robust optimization with belief functions
Marc Goerigk, Romain Guillaume, Adam Kasperski +1
In this paper, an optimization problem with uncertain objective function coefficients is considered. The uncertainty is specified by providing a discrete scenario set, containing p…
Single machine scheduling problems with uncertain parameters and the OWA criterion
Adam Kasperski, Pawel Zielinski
In this paper a class of single machine scheduling problems is discussed. It is assumed that job parameters, such as processing times, due dates, or weights are uncertain and their…
On the approximability of robust spanning tree problems
Adam Kasperski, Pawel Zielinski
In this paper the minimum spanning tree problem with uncertain edge costs is discussed. In order to model the uncertainty a discrete scenario set is specified and a robust framewor…