EVOLUTIONARY ALGORITHM FOR THE PROBLEM minimum spanning tree (MST)
DOI:
https://doi.org/10.15381/idata.v5i2.6792Keywords:
combinatorial optimization, PROBLEM TREE, EXPANSION MINIMUMAbstract
The MST has a venerable history in combinatorial optimization. It was initially developed in 1926 by Boruvka who says he had to learn for the electrification of southern Moraria where he provided a solution to find the most economical distribution through a network of a power line.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2002 Rosmeri Mayta H.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the INDUSTRIAL DATA.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating the source of publication (the originator of the work, journal, volume, number and date).
