Abstract: A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple traveling salesman problem. In our prior CTSP, each salesman is allocated a particular color and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback