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

Development of efficient and accurate heuristic algorithms of polynomial order, which achieve good solutions to complex problems in class NP-C, remains a great challenge. A strategy is proposed to improve heuristic algorithms, specifically for the euclidean traveling salesman problem, known as E-TSP. A defined set of indicators informs the extent to which programmed heuristics is reflected in the algorithm. The feedback obtained through indicators facilitates the process of refining the initial algorithm, in order to achieve better solutions.

Perfeccionando algoritmos heurísticos para el problema NP-C E-TSP