Truncated dynamic programming method in a closed traveling salesman problem with symmetric value function
E. E. Ivanko
Institute of Mathematics and Mechanics
A method for the exact solution of a closed traveling salesman problem with symmetric value function based on the dynamic programming method is presented. The method produces an optimal solution in a smaller number of operations as compared to the classical dynamic programming method. A short experiment, which compares the efficiencies of the classical scheme and of the new scheme in traveling salesman problems of different dimensions, is given in the end of the paper.
dynamic programming method, traveling salesman problem.
PDF file (166 kB)
E. E. Ivanko, “Truncated dynamic programming method in a closed traveling salesman problem with symmetric value function”, Trudy Inst. Mat. i Mekh. UrO RAN, 19, no. 1, 2013, 121–129
Citation in format AMSBIB
\paper Truncated dynamic programming method in a~closed traveling salesman problem with symmetric value function
\serial Trudy Inst. Mat. i Mekh. UrO RAN
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|