2 citations · 2 across the 1 of their papers we have counts for
Showing cs.DSShow 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.DS2018
Dispersing obnoxious facilities on a graph
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl +1
We study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal i…