%0 Journal Article
%A A. N. Maksimenko
%T Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm
%J Modelirovanie i analiz informacionnyh sistem
%D 2020
%P 72-85
%V 27
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2020_27_1_a5/
%G ru
%F MAIS_2020_27_1_a5