An O (n2) heuristic algorithm for the directed Steiner minimal tree problem
- 31 October 1980
- journal article
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 4 (5) , 369-375
- https://doi.org/10.1016/0307-904x(80)90163-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- Book Review: Combinatorial optimization: networks and matroidsBulletin of the American Mathematical Society, 1978
- Finding optimum branchingsNetworks, 1977
- Low cost drainage networksNetworks, 1976
- Flows in Transportation NetworksPublished by Elsevier ,1972
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- A Geometrical Solution of the Three Factory ProblemMathematics Magazine, 1966
- The Three Factory ProblemMathematics Magazine, 1965
- AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICSJournal of Regional Science, 1962