Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147657
Authors: 
Horbach, Andrei
Year of Publication: 
2005
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 599
Abstract: 
The k-traveling salesman problem, or k-TSP is: given a graph with edge weights and an integer k, find a simple cycle of minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation and the 1-tree relaxation can be used. We generalize these two relaxations for the k-TSP.
Subjects: 
k-traveling salesman problem
k-TSP
matching
2-matching
1-tree
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.