Related references
Note: Only part of the references are listed.THE UNBOUNDED INTEGRALITY GAP OF A SEMIDEFINITE RELAXATION OF THE TRAVELING SALESMAN PROBLEM
Samuel C. Gutekunst et al.
SIAM JOURNAL ON OPTIMIZATION (2018)
New inapproximability bounds for TSP
Marek Karpinski et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2015)
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
Etienne de Klerk et al.
MATHEMATICAL PROGRAMMING (2012)
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Etienne de Klerk et al.
MATHEMATICAL PROGRAMMING (2010)
Copositive and semidefinite relaxations of the quadratic assignment problem
Janez Povh et al.
DISCRETE OPTIMIZATION (2009)
ON SEMIDEFINITE PROGRAMMING RELAXATIONS OF THE TRAVELING SALESMAN PROBLEM
Etienne De Klerk et al.
SIAM JOURNAL ON OPTIMIZATION (2008)
Solving lift-and-project relaxations of binary integer programs
S Burer et al.
SIAM JOURNAL ON OPTIMIZATION (2006)
Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
KM Anstreicher
SIAM JOURNAL ON OPTIMIZATION (2000)
Share Paper
