5 citations · 10 across the 9 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.OC2022
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy
Marc Goerigk, Stefan Lendl, Lasse Wulf
We study the computational complexity of multi-stage robust optimization problems. Such problems are formulated with alternating min/max quantifiers and therefore naturally fall in…
cs.DS2022
Dispersing Obnoxious Facilities on Graphs by Rounding Distances
Tim A. Hartmann, Stefan Lendl
We continue the study of -dispersion, a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the i…
cs.MA2022★ 1 cited
Allocation of Indivisible Items with Individual Preference Graphs
Nina Chiarelli, Clément Dallard, Andreas Darmann +5
This paper studies the allocation of indivisible items to agents, when each agent's preferences are expressed by means of a directed acyclic graph. The vertices of each preference…