2 citations · 2 across the 2 of their papers we have counts for
3 papers
Robust recoverable 0-1 optimization problems under polyhedral uncertainty
Mmikita Hradovich, Adam Kasperski, Pawel Zielinski
This paper deals with a robust recoverable approach to 0-1 programming problems. It is assumed that a solution constructed in the first stage can be modified to some extent in the…
Recoverable robust spanning tree problem under interval uncertainty representations
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A polynomial time, combinatorial algorithm for the recoverable spanni…
The robust recoverable spanning tree problem with interval costs is polynomially solvable
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the pr…