2 Replies Latest reply on May 19, 2011 8:05 AM by 862168

    Travelling Salesman variant?

      I am having trouble searching for information on a variant of the travelling salesman problem and was curious if anyone know what this variant might be called.

      In my problem, instead of having the requirement that I visit all the nodes in a collection (might be thosands), I just want to visit the largest number of the nodes I can with a maximum total distance.

      Anybody have any ideas what I might search for to find more information and/or solutions for this variant?