An integer linear programming approach to the steiner problem in graphs
- 1 June 1980
- Vol. 10 (2) , 167-178
- https://doi.org/10.1002/net.3230100207
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting SetManagement Science, 1977
- Set Covering and Involutory BasesManagement Science, 1971
- Set Covering by Single-Branch Enumeration with Linear-Programming SubproblemsOperations Research, 1971
- 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