An Investigation of the Recoverable Robust Assignment Problem

Dennis Fischer, Tim A. Hartmann, Stefan Lendl +1

We investigate the so-called recoverable robust assignment problem on balanced bipartite graphs with $2n$ vertices, a mainstream problem in robust optimization: For two given linea…