ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 11. Vol. 24. 2018

DOI: 10.17587/it.24.698-704

M. V. Ulyanov, Leading Researcher, V. A. Trapeznikov Institute of Control Sciences of the Russian Academy of Sciences, M. V. Lomonosov Moscow State University, M. I. Fomichev, Graduate Student, National Research University Higher School of Economics

Approaches to Design Search Decision Tree in the Branch and Bound Method for the Asymmetric Traveling Salesman Problem

Run time of the Branch and Bound method for solving asymmetric Traveling Salesman Problem can be reduced by using the most appropriate data structure providing time-efficient operations with leaves of the search decision tree and additional memory for storing truncated matrices in leaves of search decision tree. In additional, different approaches for storing and handling matrices, which correspond leaves of search decision tree, can be presented. Such research should be based on the features of operations with search decision tree and matrices, generated by the specificity of the Branch and Bound method. Different approaches of storing and accessing elements of search decision tree and ways to store matrices in leaves of such tree are presented at this paper.
Keywords: branch and bound method, asymmetric Traveling Salesman Problem, search decision tree, data structure, truncated matrices structure

P. 698–704  

To the contents