The Traveling Saleman Problem with Many Visits to Few Cities
We study the version of the traveling salesman problem in which a relatively small number of cities -- say, six -- must be visited a huge number of times -- e.g., several hundred times each. )It costs to go from one city to itself). We develop an algorithm for this problem whose running time is expo...
Main Authors: | Cosmadakis, Stavros S., Papadimitriou, Christos H. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149019 |
Similar Items
-
Implementasi algoritma ant colony system untuk menyelesaikan traveling saleman problem yang dipandu dengan data geografis
by: , SEPTIMA, Uzma, et al.
Published: (2008) -
Computational Complexity and the Traveling Salesman Problem
by: Johnson, David, et al.
Published: (2023) -
Many are called, few are chosen.
by: Goding, C
Published: (2011) -
The Complexity of Evaluation Relational Queries
by: Cosmadakis, Stavros S.
Published: (2023) -
Exact results for many-body problems using few-body methods
by: Cardy, J
Published: (2006)