42 citations · 42 across the 1 of their papers we have counts for
2 papers
math.OC2009★ 42 cited
On semidefinite programming relaxations of the traveling salesman problem
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP) that may be obtained via an SDP relaxation of the more general quadrat…
math.CO2005
A note on the stability number of an orthogonality graph
E. de Klerk, D. V. Pasechnik
We consider the orthogonality graph Omega(n) with 2^n vertices corresponding to the 0-1 n-vectors, two vertices adjacent if and only if the Hamming distance between them is n/2. We…