105 search results - page 4 / 21 » On Semidefinite Programming Relaxations of the Traveling Sal... |
NCA
2008
IEEE
13 years 7 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
SIAMJO
2008
13 years 7 months ago
2008
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
MP
2010
13 years 1 months ago
2010
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...