On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem
The paper describes some ways to accelerate solving the NP-complete Traveling Salesman Problem. The classic Little algorithm belonging to the category of ”branch and bound methods” can solve it both for directed and undirected graphs. However, for undirected graphs its operation can be accelerated b...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2016-08-01
|
| Series: | Modelirovanie i Analiz Informacionnyh Sistem |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/366 |