Geodesic
Exact and approximate solutions of the traveling salesman problem of large size
Numerical methods and programming, Tome 25 (2024) no. 4, pp. 476-482 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This paper describes a fast heuristic algorithm based on branch-and-bound for the traveling salesman problem with a set approximation ratio, i.e. with a parameter k that guarantees that the solution obtained by the algorithm is at most 1/k times worse than the optimal solution. The algorithm is designed for shared-memory systems.
Keywords: traveling salesman problem, exact algorithm, parallel algorithm, branch-and-bound.
Mots-clés : heuristic algorithm 
@article{VMP_2024_25_4_a7,
     author = {V. V. Burkhovetskiy and B. Ya. Steinberg},
     title = {Exact and approximate solutions of the traveling salesman problem of large size},
     journal = {Numerical methods and programming},
     pages = {476--482},
     year = {2024},
     volume = {25},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2024_25_4_a7/}
}
TY  - JOUR
AU  - V. V. Burkhovetskiy
AU  - B. Ya. Steinberg
TI  - Exact and approximate solutions of the traveling salesman problem of large size
JO  - Numerical methods and programming
PY  - 2024
SP  - 476
EP  - 482
VL  - 25
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VMP_2024_25_4_a7/
LA  - ru
ID  - VMP_2024_25_4_a7
ER  - 
%0 Journal Article
%A V. V. Burkhovetskiy
%A B. Ya. Steinberg
%T Exact and approximate solutions of the traveling salesman problem of large size
%J Numerical methods and programming
%D 2024
%P 476-482
%V 25
%N 4
%U http://geodesic.mathdoc.fr/item/VMP_2024_25_4_a7/
%G ru
%F VMP_2024_25_4_a7
V. V. Burkhovetskiy; B. Ya. Steinberg. Exact and approximate solutions of the traveling salesman problem of large size. Numerical methods and programming, Tome 25 (2024) no. 4, pp. 476-482. http://geodesic.mathdoc.fr/item/VMP_2024_25_4_a7/