1 paper
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…