Cao, Buyang; Glover, Fred - In: Management Science 43 (1997) 7, pp. 908-921
A cardinality-constrained TSP (CC-TSP) problem requires the salesman to visit at least L and at most U cities, represented by nodes of a graph. The objective of this problem is to maximize the sum of weights of nodes visited. In this paper we propose a tabu search method based on ejection chain...