Narrow search
Showing 1 - 4 of 4
Cover Image
On Semidefinite Programming Relaxations of the Traveling Salesman Problem
de Klerk, Etienne - 2008
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 quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: D. Cvetkovic, M....
Persistent link: https://www.econbiz.de/10012722396
Cover Image
On semidefinite programming relaxations of the traveling salesman problem
Klerk, Etienne de (contributor);  … - 2008 - Rev. version of CentER Discussion Paper 2007,101
Persistent link: https://www.econbiz.de/10003777878
Cover Image
On semidefinite programming relaxations of the travelling salesman problem
Klerk, Etienne de (contributor);  … - 2007
Persistent link: https://www.econbiz.de/10003653581
Cover Image
On semidefinite programming relaxations of association schemes with application to combinatorial optimization problems
Klerk, Etienne de; Pasechnik, Dmitrii V. - 2009
Persistent link: https://www.econbiz.de/10003865784