18 citations · 72 across the 24 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
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 vertices, a mainstream problem in robust optimization: For two given linea…
cs.DS2020
Travelling salesman paths on Demidenko matrices
Eranda Cela, Vladimir G. Deineko, Gerhard J. Woeginger
In the path version of the Travelling Salesman Problem (Path-TSP), a salesman is looking for the shortest Hamiltonian path through a set of n cities. The salesman has to start his…