For a description of this problem see:
Description
Only the smaller instances (upto NL10, CIRC8) give results in a few minutes.
The larger instances may run forever!
See also my other Dynamic programming stuff (Traveling Salesman Problem. Quadratic Assignment Problem)