# 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

#### Figures, Tables, and Topics from this paper

#### One Citation

Distance Transformation for Network Design Problems

- Mathematics, Computer Science
- SIAM J. Optim.
- 2019

#### References

SHOWING 1-10 OF 15 REFERENCES

The prize collecting Steiner tree problem: theory and practice

- Mathematics, Computer Science
- SODA '00
- 2000

Strong formulations for network design problems with connectivity requirements

- Computer Science
- Networks
- 2005

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design

- Mathematics, Computer Science
- Oper. Res.
- 1989

The Steiner tree polytope and related polyhedra

- Mathematics, Computer Science
- Math. Program.
- 1994

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game

- Computer Science, Mathematics
- SIAM J. Comput.
- 2008

The Steiner tree problem I: Formulations, compositions and extension of facets

- Mathematics, Computer Science
- Math. Program.
- 1994

Formulations and algorithms for network design problems with connectivity requirements

- Computer Science
- 1995

Submodular Functions, Matroids, and Certain Polyhedra

- Mathematics, Computer Science
- Combinatorial Optimization
- 2001