Digital data networks design using genetic algorithms
Authors:
- Chao-Hsien ChuCCChao-Hsien Chu
- G. PremkumarGPG. Premkumar
- Hsinghua ChouHCHsinghua Chou
- 16 November 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 127 (1) , 140-158
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithmNetworks, 1995
- An approach to a problem in network design using genetic algorithmsNetworks, 1995
- Genetic algorithms and tabu search: Hybrids for optimizationComputers & Operations Research, 1995
- Optimal network partitioning for fault-tolerant network management using evolutionary programmingInformation Processing Letters, 1994
- A genetic algorithm for channel assignment problemsEuropean Transactions on Telecommunications, 1994
- Solving the Graphical Steiner Tree Problem Using Genetic AlgorithmsJournal of the Operational Research Society, 1993
- Least-cost network topology design for a new serviceAnnals of Operations Research, 1991
- Steiner problem in networks: A surveyNetworks, 1987
- An O(n log n) heuristic for steiner minimal tree problems on the euclidean metricNetworks, 1981
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956