⇐ home               


SDP Relaxation of the Traveling Salesman Problem




 Instance    Size (MB)   Optimal value   n_SDP   m_SDP   n_max   Structure 
  TSPbays29      4.997   1999.76551      13862   6090   29   symmetry  
  TSPeil51      42.522           ?*      71502   33150   51   symmetry  

                                                                ◊   “ * ” indicates numerical difficulties, i.e., the optimal values are uncertain or only known with low accuracy
                                                                ◊   n_MAX refers to the largest block in the matrix variable in the case of block diagonal structure

  • All TSP files (.zip)