On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)
AbstractAMS classification: 90C22, 20Cxx, 70-08
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2007-101.
Date of creation: 2007
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
traveling salesman problem; semidefinite programming; quadratic as- signment problem;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
This paper has been announced in the following NEP Reports:
- NEP-ALL-2008-01-05 (All new papers)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Klerk, E. de & Sotirov, R., 2007.
"Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem,"
2007-44, Tilburg University, Center for Economic Research.
- Klerk, E. de & Sotirov, R., 2010. "Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem," Open Access publications from Tilburg University urn:nbn:nl:ui:12-3125772, Tilburg University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.