TY  - JOUR
AU  - Yu. L. Kostyuk
TI  - The traveling salesman problem: approximate algorithm by branch-and-bound method with~guaranteed precision
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2019
SP  - 104
EP  - 112
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2019_3_a12/
LA  - ru
ID  - PDM_2019_3_a12
ER  -