Title of article :
NEW RESULTS ON THE OLD k-OPT ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
Author/Authors :
CHANDRA، BARUN نويسنده , , KARLOFF، HOWARD نويسنده , , TOVEY، CRAIG نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Abstract :
An associative block design is a certain balanced partition of a hypercube into smaller hypercubes. We construct such a design, thus settling the smallest open case.
Keywords :
graph algorithms , analysis of algorithms , explicit machine computation and programs (in optimization heading) , explicit machine computation and programs (in computer science heading)
Journal title :
SIAM Journal on Computing
Journal title :
SIAM Journal on Computing
