Improved algorithms for the Steiner problem in networks

@article{Polzin2001ImprovedAF,
  title={Improved algorithms for the Steiner problem in networks},
  author={Tobias Polzin and Siavash Vahdati Daneshmand},
  journal={Discrete Applied Mathematics},
  year={2001},
  volume={112},
  pages={263-300}
}
We present several new techniques for dealing with the Steiner problem in (undirected) networks. We consider them as building blocks of an exact algorithm, but each of them could also be of interest in its own right. First, we consider some relaxations of integer programming formulations of this problem and investigate different methods for dealing with these relaxations, not only to obtain lower bounds, but also to get additional information which is used in the computation of upper bounds and… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
49 Citations
28 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 49 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

SteinLib. ftp://ftp.zib.de/pub/Packages/mp-testdata/steinlib/index. html,1997

  • T. Koch, A. Martin
  • 1997
Highly Influential
8 Excerpts

Algorithmen für das Steiner-Problem

  • T. Polzin, S. Vahdati Daneshmand
  • Master's thesis, Universität Dortmund
  • 1997
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…