Solving combinatorial optimization problems by gradient flows

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.<
>