1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2023
Extremal solutions for Network Flow with Differential Constraints -- A Generalization of Spanning Trees
René Brandenberg, Paul Stursberg
In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is t…
math.OC2019★ 1 cited
Cut Selection For Benders Decomposition
Rene Brandenberg, Paul Stursberg
In this paper, we present a new perspective on cut generation in the context of Benders decomposition. The approach, which is based on the relation between the alternative polyhedr…
cs.GT2016
Interdependent Scheduling Games
Andres Abeliuk, Haris Aziz, Gerardo Berbeglia +7
We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently. A player is free to schedule his own service…