Zaslat SMS: On semidefinite programming relaxations of the traveling salesman problem