What is the good thesis problem for bs math major comp. scie?
The traveling salesman problem is always good for new analysis – but be forewarned, it’s been chewed to death already. When I did an implementation last, I stored the intermediate solutions in a persistant database, then only recalculated the affected routes when a point was added or removed. The inital run took many days (for 100 stops), but only a few minutes after that when a stop was added or removed.
