This is a preview. Log in through your library . Abstract 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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback