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?
(Did not realize that it for 4 Month's old, Please delete if appropriate).
Most Heuristic and approximation algorithms are a good start for this problem.
There are no "Correct Algorithm" to this problem, just good solutions
Edited by: James9111 on Mar 2, 2011 3:54 AM