An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- 1 March 1998
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 25 (3), 229-237
- https://doi.org/10.1016/s0305-0548(97)00039-7
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- An approach to a problem in network design using genetic algorithmsNetworks, 1995
- On lower bounds for a class of quadratic 0, 1 programsOperations Research Letters, 1985
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957