3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DM2017
MIP Formulations for the Steiner Forest Problem
Daniel Schmidt, Bernd Zey, François Margot
The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programming bounds for the problem is the key for both fast Branch-and-Bound algor…
cs.DM2016★ 3 cited
ILP formulations for the two-stage stochastic Steiner tree problem
Bernd Zey
We give an overview of new and existing cut- and flow-based ILP formulations for the two-stage stochastic Steiner tree problem and compare the strength of the LP relaxations.