Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices☆
Under an Elsevier user license
open archive
Keywords
Traveling salesman problem
2-matching
Approximation algorithm
Cited by (0)
- ☆
This research was partially supported by grants from the Natural Sciences and Engineering Research Council of Canada.
- 1
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000.
Copyright © 2011 Elsevier B.V. All rights reserved.