Does anyone know of a perl module that solves the "traveling salesman" problem?
Given a number of addresses, find the shortest path that covers all the destinations. Part two of the problem would have multiple salesmen and a slew of addresses, and the program would need to figure out the best route for each salesman that covers all destinations. Greg
