activity
20092022
most citedRobust Multicovers with Budgeted Uncertainty

12 citations · 15 across the 8 of their papers we have counts for

collaborators

13 papers

cs.GT2022

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…

cs.CC2021

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…

cs.GT20211 cited

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…

math.CO2020

On the Bicriterion Maximum Flow Network Interdiction Problem

Luca E. Schäfer, Stefan Ruzika, Sven O. Krumke +1

This article focuses on a biobjective extension of the maximum flow network interdiction problem, where each arc in the network is associated with two capacity values. Two maximum…

math.OC2020

Robust Single Machine Makespan Scheduling with Release Date Uncertainty

Oliver Bachtler, Sven O. Krumke, Huy Minh Le

This paper addresses the robust single machine makespan scheduling with uncertain release dates of the jobs. The release dates take values within know intervals. We use the concept…

cs.DS2020

Scheduling a Proportionate Flow Shop of Batching Machines

Christoph Hertrich, Christian Weiß, Heiner Ackermann +2

In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number of machines. The scheduling problem has so far barely receive…