Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
https://doi.org/10.18255/1818-1015-2020-1-72-85
Abstract
In this paper, we consider the notion of a direct type algorithm introduced by V. A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties. the concept of a direct type algorithm is determined using the graph of solutions of a combinatorial optimization problem. e vertices of this graph are all feasible solutions of a problem. Two solutions are called adjacent if there are input data for which these and only these solutions are optimal. A key feature of direct type algorithms is that their complexity is bounded from below by the clique number of the solutions graph. In 2015-2018, there were five papers published, the main results of which are estimates of the clique numbers of polyhedron graphs associated with various combinatorial optimization problems. the main motivation in these works is the thesis that the class of direct type algorithms is wide and includes many classical combinatorial algorithms, including the branch and bound algorithm for the traveling salesman problem, proposed by J. D. C. Little, K. G. Murty, D. W. Sweeney, C. Karel in 1963. We show that this algorithm is not a direct type algorithm. Earlier, in 2014, the author of this paper showed that the Hungarian algorithm for the assignment problem is not a direct type algorithm. us, the class of direct type algorithms is not so wide as previously assumed.
About the Author
Aleksandr N. Maksimenko
P. G. Demidov Yaroslavl State University
Russian Federation
PhD
Russian Federation
PhD
References
1. V. Bondarenko, A. Nikolaev, and D. Shovgenov, “1-skeletons of the spanning tree problems with additional constraints”, Automatic Control and Computer Sciences, vol. 51, no. 7, pp. 682–688, 2017.
2. V. Bondarenko and A. Nikolaev, “On graphs of the cone decompositions for the min-cut and max-cut problems”, International Journal of Mathematics and Mathematical Sciences, vol. 2016, 2016.
3. V. Bondarenko and A. Nikolaev, “Some properties of the skeleton of the pyramidal tours polytope”, Electronic Notes in Discrete Mathematics, vol. 61, pp. 131–137, 2017.
4. V. A. Bondarenko, A. V. Nikolaev, and D. Shovgenov, “Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems”, Automatic Control and Computer Sciences, vol. 51, no. 7, pp. 576–585, 2017.
5. V. Bondarenko and A. Nikolaev, “On the skeleton of the polytope of pyramidal tours”, Journal of Applied and Industrial Mathematics, vol. 12, no. 1, pp. 9–18, 2018.
6. V. Bondarenko, “Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms”, Automation and Remote Control, vol. 44, no. 9, pp. 1137–1142, 1983.
7. V. Bondarenko, “Geometricheskie metody sistemnogo analiza v kombinatornoy optimizatsii”, diss. ... dokt.fiz.-mat. nauk, Yaroslavl, 1993.
8. V. Bondarenko and A. Maksimenko, Geometricheskie konstruktsii i slozhnost v kombinatornoy optimizatsii. Moskva: URSS, 2008, 182 pp.
9. A. Maksimenko, “Kharakteristiki slozhnosti: klikovoe chislo grafa mnogogrannika i chislo pryamougolnogo pokrytiya”, Modelirovanie i analiz informatsionnykh sistem, vol. 21, no. 5, pp. 116–130, 2014.
10. J. Little, K. Murty, D. Sweeney, and C. Karel, “An algorithm for the traveling salesman problem”, Operations research, vol. 11, no. 6, pp. 972–989, 1963.
11. E. Reingold, J. Nievergelt, and N. Deo, Combinatorial algorithms: theory and practice. Pearson College Div, 1977, 433 pp.
12. M. Padberg and M. Rao, “The travelling salesman problem and a class of polyhedra of diameter two”, Mathematical Programming, vol. 7, no. 1, pp. 32–45, 1974.
Review
For citations:
Maksimenko A.N. Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm. Modeling and Analysis of Information Systems. 2020;27(1):72-85. (In Russ.) https://doi.org/10.18255/1818-1015-2020-1-72-85
Views:
1287
Email this article 