EVOLUTIONARY ALGORITHM FOR THE PROBLEM minimum spanning tree (MST)
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.
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2002 |
| País: | Perú |
| Institución: | Universidad Nacional Mayor de San Marcos |
| Repositorio: | Revistas - Universidad Nacional Mayor de San Marcos |
| Idioma: | español |
| OAI Identifier: | oai:revistasinvestigacion.unmsm.edu.pe:article/6792 |
| Acceso en línea: | https://revistasinvestigacion.unmsm.edu.pe/index.php/idata/article/view/6792 |
| Access Level: | acceso abierto |
| Palabra clave: | combinatorial optimization PROBLEM TREE EXPANSION MINIMUM optimización combinatoria PROBLEMA DE ÁRBOL EXPANSIÓN MÍNIMA |
| Sumario: | 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. |
|---|