English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper explain the traveling salesman problem, solving it through the parallel application of a genetic algorithm, implemented in C language, using OpenMP directives. These solutions to the problem consists to find the shortest route visiting all the cities without repeating some and with the lowest possible cost. The tests were performed at “Laboratorio Nacional de Supercómputo del Sureste de México” and the results are compared with benchmark problems reported in the literature.

Implementación paralela de un algoritmo genético para el problema del agente viajero usando OpenMP