Papers

Topics

Authors

Recent

View all

Assistant

AI Research Assistant

Well-researched responses based on relevant abstracts and paper content.

Custom Instructions Pro

Preferences or requirements that you'd like Emergent Mind to consider when generating responses.

Gemini 2.5 Flash

Gemini 2.5 Flash 78 tok/s

Gemini 2.5 Pro 55 tok/s Pro

GPT-5 Medium 30 tok/s Pro

GPT-5 High 28 tok/s Pro

GPT-4o 83 tok/s Pro

Kimi K2 175 tok/s Pro

GPT OSS 120B 444 tok/s Pro

Claude Sonnet 4.5 34 tok/s Pro

2000 character limit reached

Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm (1811.03031v1)

Published 7 Nov 2018 in cs.DS and cs.CC

Abstract: In this paper, we consider the notion of a direct type algorithm introduced by V.A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties. Until recently, it was thought that the class of direct type algorithms is wide and includes many classical combinatorial algorithms, including the branch and bound algorithm for the traveling salesman problem, 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.