Title :
Solving combinatorial optimization problems by gradient flows
Author :
Wong, Wing Shing
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong
Abstract :
The relationship between certain NP-hard combinatorial optimization problems and gradient flows on the special orthogonal group is examined. It is shown that there is a correspondence between the local minima of a heuristic local search algorithm and the local minima of the gradient flow on the group
Keywords :
computational complexity; optimisation; search problems; NP-hard problems; combinatorial optimization problems; gradient flows; heuristic local search algorithm; local minima; special orthogonal group; Circuits; Cities and towns; Cost function; Heuristic algorithms; NP-hard problem; Polynomials; Traveling salesman problems;
Conference_Titel :
Decision and Control, 1992., Proceedings of the 31st IEEE Conference on
Conference_Location :
Tucson, AZ
Print_ISBN :
0-7803-0872-7
DOI :
10.1109/CDC.1992.371166
