Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem

Authors:
Dragos Cvetkovic;Mirjana Cangalovic;Vera Kovacevic-Vujcic
Affiliations:
-;-;-
Venue:
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
1999

Citing 9
Cited 1

An optimal solution method for large-scale multiple traveling salesmen problems

Operations Research
New lower bounds for the symmetric travelling salesman problem

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Solution of large-scale symmetric travelling salesman problems

Mathematical Programming: Series A and B
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Semidefinite programming

SIAM Review
Semidefinite programming in combinatorial optimization

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Combinatorial optimization

Combinatorial optimization
Approximate graph coloring by semidefinite programming

Journal of the ACM (JACM)

Cutting Planes for Mixed 0-1 Semidefinite Programs

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the symmetric traveling salesman problem (STSP) is modeled as a problem of discrete semidefinite programming. A class of semidefinite relaxations of STSP model is defined and two variants of a branch-and-bound technique based on this class of relaxations are proposed. The results of preliminary numerical experiments with randomly generated problems are reported.