what algorithm should i go for to solve travelling salesman problem where number of cities can be upto 1000.
and what to do if multiple ( i.e more than one salesman ) can be allowed to the deliver the grocery items. in a limited time of say 3 hours. the salesman travel through the vechile which has some fixed speed . any idea or give some link where i can find some source code on multiple salesman problem -- You received this message because you are subscribed to the Google Groups "Google Code Jam" 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-code?hl=en.
