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…
cs.IT2005
A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov +1
In Multi-Input Multi-Output (MIMO) systems, Maximum-Likelihood (ML) decoding is equivalent to finding the closest lattice point in an N-dimensional complex space. In general, this…