105 search results - page 1 / 21 » On Semidefinite Programming Relaxations of the Traveling Sal... |
SIAMJO
2008
13 years 4 months ago
2008
TOC
2008
13 years 4 months ago
2008
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
ANOR
2008
13 years 5 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
JSAT
2006
13 years 4 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...