| Article ID: | iaor1996592 |
| Country: | Netherlands |
| Volume: | 58 |
| Issue: | 2 |
| Start Page Number: | 284 |
| End Page Number: | 292 |
| Publication Date: | Apr 1992 |
| Journal: | European Journal of Operational Research |
| Authors: | Beasley J.E. |
| Keywords: | Steiner problem |
This paper presents a heuristic for Euclidean and rectilinear Steiner problems. This heuristic is based upon finding optimal Steiner solutions for connected subgraphs of the minimal spanning tree of the entire vertex set. Computational results are given for randomly generated problems involving up to 10000 vertices.