An algorithm for the steiner problem in graphs
- 1 March 1984
- Vol. 14 (1) , 147-159
- https://doi.org/10.1002/net.3230140112
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An algorithm for the steiner problem in graphsNetworks, 1982
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- Validation of subgradient optimizationMathematical Programming, 1974
- Cost-minimal trees in directed acyclic graphsMathematical Methods of Operations Research, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957