tsp

SDP Relaxation of the Traveling Salesman Problem

◊ TSPeil51 - very difficult instance - solved by Hans Mittelmann

◊ n_max refers to the largest block in the matrix variable in the case of block diagonal structure