TY  - JOUR
AU  - A. N. Maksimenko
TI  - Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2020
SP  - 72
EP  - 85
VL  - 27
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2020_27_1_a5/
LA  - ru
ID  - MAIS_2020_27_1_a5
ER  -