Corpus ID: 27364172

MIP Formulations for the Steiner Forest Problem

@article{Schmidt2017MIPFF,
  title={MIP Formulations for the Steiner Forest Problem},
  author={Daniel R. Schmidt and Bernd Zey and F. Margot},
  journal={ArXiv},
  year={2017},
  volume={abs/1709.01124}
}
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 algorithms and good primal-dual approximations. On the theoretical side, the best known bound can be obtained from an integer program [KLSv08]. It guarantees a value that is a (2-eps)-approximation of the integer optimum. On the practical side, bounds from a mixed integer program by Magnanti and Raghavan [MR05] are very… Expand
Distance Transformation for Network Design Problems

References

SHOWING 1-10 OF 15 REFERENCES
The Steiner tree polytope and related polyhedra
  • M. Goemans
  • Mathematics, Computer Science
  • Math. Program.
  • 1994
A catalog of steiner tree formulations
The Steiner tree problem I: Formulations, compositions and extension of facets
Submodular Functions, Matroids, and Certain Polyhedra
  • J. Edmonds
  • Mathematics, Computer Science
  • Combinatorial Optimization
  • 2001
...
1
2
...