7 citations · 9 across the 10 of their papers we have counts for
1 paper · 1 filter
Samuel C. Gutekunst, David P. Williamson
We study a semidefinite programming relaxation of the traveling salesman problem introduced by de Klerk, Pasechnik, and Sotirov [8] and show that their relaxation has an unbounded…