Author Topic: Visual C++ - Travelling Salesman Problem Solved  (Read 2164 times)


  • Administrator
  • Sr. Member
  • *****
  • Posts: 283
Visual C++ - Travelling Salesman Problem Solved
« on: May 24, 2011, 09:52:56 pm »
Travelling salesman problem can be solved easily if there are only 4 or 5 cities in our input.

But if there are more than 20 or 50 cities, the perfect solution would take couple of years to compute.


I have discussed here about the solution which is faster and obviously not the best solution using dynamic programming. For more details and source code visit at the following location:
« Last Edit: June 14, 2011, 03:45:14 pm by kathir »


Disclaimer: This web site is for educational and informational purposes only. Click here to read the Disclaimer.
Content copyright 2010-2014. Kathiresan. All rights reserved.
This page is using SMF version 2.0.1