| Article ID: | iaor20061021 |
| Country: | Germany |
| Volume: | 10 |
| Issue: | 4 |
| Start Page Number: | 277 |
| End Page Number: | 296 |
| Publication Date: | Dec 2002 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Kovaevi-Vuji Vera, angalovi Mirjana, Kratica Jozef |
| Keywords: | programming: integer |
This paper studies the behavior of the semidefinite programming method proposed by Helmberg, Rendl, Vanderbei and Wolkowicz on a special class of semidefinite programs obtained as relaxations of the symmetric traveling salesman problem (STSP). We propose modifications which reduce the computational time and improve numerical stability. Computational results for the STSP instances with dimensions up to 60 are reported.