ISSN 2587-814X (print), ISSN 2587-8158 (online)
Russian version: ISSN 1998-0663 (print), ISSN 2587-8166 (online)
Exact time-efficient combined algorithm for solving the asymmetric traveling salesman problem
Resource characteristics of ways to organize a decision tree in the branch-and-bound method for the traveling salesmen problem
© 
