# Improved algorithms for the Steiner problem in networks

@article{Polzin2001ImprovedAF, title={Improved algorithms for the Steiner problem in networks}, author={T. Polzin and S. V. Daneshmand}, journal={Discret. Appl. Math.}, 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

#### Topics from this paper.

94 Citations

Dual Heuristics on the Exact Solution of Large Steiner Problems

- Mathematics, Computer Science
- 2001

- 48
- PDF

On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs

- Computer Science
- 2002

- 48
- Highly Influenced

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

- Mathematics, Computer Science
- 2002

- 168
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 37 REFERENCES

A Faster Approximation Algorithm for the Steiner Problem in Graphs

- Mathematics, Computer Science
- 1988

- 332

An SST-based algorithm for the steiner problem in graphs

- Mathematics, Computer Science
- 1989

- 161
- Highly Influential

An algorithm for the steiner problem in graphs

- Mathematics, Computer Science
- 1984

- 147
- Highly Influential

An integer linear programming approach to the steiner problem in graphs

- Mathematics, Computer Science
- 1980

- 148

A dual ascent approach for steiner tree problems on a directed graph

- Mathematics, Computer Science
- 1984

- 348
- Highly Influential

Reduction tests for the steiner problem in grapsh

- Mathematics, Computer Science
- 1989

- 78
- Highly Influential