The node‐weighted steiner tree problem
- 1 January 1987
- Vol. 17 (1), 1-17
- https://doi.org/10.1002/net.3230170102
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and boundsNetworks, 1985
- An algorithm for the steiner problem in graphsNetworks, 1984
- Topological design of centralized computer networks—formulations and algorithmsNetworks, 1982
- An algorithm for the steiner problem in graphsNetworks, 1982
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971