> The idea of the application is to take n number of locations and > calculate the closest location for all given employees to travel to, > then show this location and the routes from all other locations on the > map. If you have any suggestions as to how I can do this more > efficiently I would be very appreciative.
Is this a variation on the classic 'Travelling Salesman Problem' ? http://www.google.co.uk/search?hl=en&q=travelling+salesman+problem&meta= --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/Google-Maps-API?hl=en -~----------~----~----~----~------~----~------~--~---
