This study aims to apply the Durbin-Willshaw elastic net using parallel algorithms in order to solve the Traveling Salesman Problem (TSP) through a Beowulf cluster architecture for High-Performance Computing. The solutions for the TSP for the different number of cities are achieved by the minimiz...
Enlace original:
http://repositoriodigital.uct.cl/handle/10925/2791
Lévano Huamaccto, Marcos
,
Albornoz, Andrea
,
Jayne, C
,
Iliadis, L
,
[Elastic Net Application: Case Study to Find Solutions for the TSP in a Beowulf Cluster Architecture]
,
Elastic Net Application: Case Study to Find Solutions for the TSP in a Beowulf Cluster Architecture
