1 citations · 1 across the 7 of their papers we have counts for
8 papers
p-median location interdiction on trees
Lena Leiß, Till Heller, Luca E. Schäfer +2
In p-median location interdiction the aim is to find a subset of edges in a graph, such that the objective value of the p-median problem in the same graph without the selected edge…
On Reward-Penalty-Selection Games
Niklas Gräf, Till Heller, Sven O. Krumke
The Reward-Penalty-Selection Problem (RPSP) can be seen as a combination of the Set Cover Problem (SCP) and the Hitting Set Problem (HSP). Given a set of elements, a set of reward…
Computing the egalitarian allocation with network flows
T. Heller, S. O. Krumke
In a combinatorial exchange setting, players place sell (resp. buy) bids on combinations of traded goods. Besides the question of finding an optimal selection of winning bids, the…
The Reward-Penalty-Selection Problem
T. Heller, S. O. Krumke, K. -H. Küfer
The Set Cover Problem (SCP) and the Hitting Set Problem (HSP) are well-studied optimization problems. In this paper we introduce the Reward-Penalty-Selection Problem (RPSP) which c…
On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation
N. Gräf, T. Heller, S. O. Krumke
The Egalitarian Allocation (EA) is a well-known profit sharing method for cooperative games which attempts to distribute profit among participants in a most equal way while respect…
A unified approach to inverse robust optimization problems
Holger Berthold, Till Heller, Tobias Seidel
A variety of approaches has been developed to deal with uncertain optimization problems. Often, they start with a given set of uncertainties and then try to minimize the influence…