Path-distance heuristics for the Steiner problem in undirected networks
- 1 June 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6) , 309-327
- https://doi.org/10.1007/bf01758765
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Reduction tests for the steiner problem in grapshNetworks, 1989
- An SST‐based algorithm for the steiner problem in graphsNetworks, 1989
- Problem reduction methods and a tree generation algorithm for the steiner network problemNetworks, 1987
- An algorithm for the steiner problem in graphsNetworks, 1984
- A fast algorithm for Steiner treesActa Informatica, 1981
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956