%0 Journal Article
%A Yu. L. Kostyuk
%T The traveling salesman problem: approximate algorithm by branch-and-bound method with~guaranteed precision
%J Prikladnaâ diskretnaâ matematika
%D 2019
%P 104-112
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2019_3_a12/
%G ru
%F PDM_2019_3_a12