Analysis of the optimizer's performance in solving the traveling salesman problem

Abstract

The execution time of the algorithm depends on the optimization problem being solved, i.e., on the TSP, the structure of the computing device, the time required for elementary operations such as shifting and addition, and the required precision of the calculations. We will consider asymptotic estimates of the algorithm's execution speed for twice continuously differentiable functions.