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/

Zendy Plus

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

Zendy Tools

Zendy Open

In this paper, we consider the notion of a direct type algorithm introducedby V.A. Bondarenko in 1983. A direct type algorithm is a linear decision treewith some special properties. Until recently, it was thought that the class ofdirect type algorithms is wide and includes many classical combinatorialalgorithms, including the branch and bound algorithm for the traveling salesmanproblem, proposed by J.D.C. Little, K.G. Murty, D.W. Sweeney, C. Karel in 1963.We show that this algorithm is not a direct type algorithm.

Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm