Publications in Math-Net.Ru
-
The traveling salesman problem: approximate algorithm by branch-and-bound method with guaranteed precision
Prikl. Diskr. Mat., 2019, no. 45, 104–112
-
Effective translation for LL(1)-grammar in the example of a programming language
Prikl. Diskr. Mat., 2017, no. 37, 90–99
-
The travelling salesman problem: improved lower bound in the branch-and-bound method
Prikl. Diskr. Mat., 2013, no. 4(22), 73–81
-
Effective implementation of algorithm for solving the travelling salesman problem by branch-and-bound method
Prikl. Diskr. Mat., 2013, no. 2(20), 78–90
-
A metric traveling salesman problem for segments
Avtomat. i Telemekh., 2000, no. 3, 142–148
-
An efficient algorithm for the approximate solution of the metric traveling salesman problem
Diskretn. Anal. Issled. Oper., Ser. 2, 7:1 (2000), 65–74
© , 2024