ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A commonly studied relaxation of the travelling salesman problem is obtained by adding subtour elimination constraints to the constraints of a 2-factor problem and removing the integrality requirement. We investigate the problem of solving this relaxation for a special type of objective function. We also discuss some ways in which this relates to the concept of rank introduced by Chvátal.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01588786
Permalink