7 citations · 12 across the 22 of their papers we have counts for
1 paper · 2 filters
Samuel C. Gutekunst, David P. Williamson
De Klerk, Pasechnik, and Sotirov give a semidefinite programming constraint for the Traveling Salesman Problem (TSP) based on the matrix-tree Theorem. This constraint says that the…