|
|
|
|
|
Giuseppe Lancia and Marcello Dalpasso
Given a Traveling Salesman Problem solution, the best 3-OPT move requires us to remove three edges and replace them with three new ones so as to shorten the tour as much as possible. No worst-case algorithm better than the T(??3)
T
(
n
3
)
enumeration o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Giuseppe Lancia and Marcello Dalpasso
We describe a simple data structure for storing subsets of {0,?,??-1}
{
0
,
?
,
N
-
1
}
, with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least one such o...
ver más
|
|
|
|
|
|