Venkatesh Pandiri

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Given a set of n cities and m salesmen stationed at d depots, the fixed destination multidepot salesmen problem consists in finding tours for all the salesmen which start and end at their corresponding fixed depots such that each city is visited exactly once by one salesman only, the workload among salesmen is balanced and the total distance traveled by all(More)
  • 1