Travelling salesman problem using Dynamic Programming

TSP Hello. I am interesting in your project. I am Algorithm and C++ expert. Please look my reviews and portfolios. I can solve your problem. If you hire me, you can get the best chance to know another web master and the best results for a short time as lowest cost. I will always wait for your good news.

Hello, my name is Pavel. I'm good in Java programming anc C++ and algorithms (took part in ACM ICPC Regionals) I solved this task with DP algorithms many times. Here is a code sample (C++): int d[1 << 17][17]; //Lets say 17 is a maximum count of vertices int n; //count of vertices int a[17][17]; ... for(int i = 0; i < (1 << n); i++) { for(int j = 0; j < n; j++) { for(int k = 0; k < n; k++) { if(((1 << k) & i) == 0 && a[j][k] != 0) { if( d[i | (1 << k)][k] > d[i][j] + a[j][k]) { d[i | (1 << k)][k] = d[i][j] + a[j][k]; } } } } } Thank you!

TSP Dear client. I've read your project description carefully and very interested. Let's discuss over chat and get started. Waiting for your reply. Regards.

TSP My preferred method of freelancing is an interactive approach to project solving. I have an MSEE specializing in Digital Signal/Image/RF Processing. I do my work in MATLAB (expert). I am also an expert console C programmer.

I have written program solving TSP problem in C++ and tested it using brute solution. It solves problem with 20 vertices in less than second.