Vera Kovačević-Vujčić
Mirjana Čangalović
Jozef Kratica
The paper studies behaviour of the semidefinite programming method proposed by Helmberg, Rendl, Vanderbei and Wolkowicz on a special class of semidefinite programs obtained as relaxations of the traveling salesman problem. We propose a choice of the initial solution which reduces the number of iterations and an iterative procedure for handling the ineaquality constraints which reduces the complexity per step. Computational results for the TSP instances with dimensions up to 60 are also reported.
Back to Jozef's Papers Home Page | Back to Jozef's Home Page | Go to Workshop home page