Narendar kumar's repositories
Optimization-of-Travelling-Salesman-Problem
Solved TSP using SA(simulated annealing),GA(Genetic algorithm),DP(Dynamic Programming) and LP(Linear programming) and comparison between them as a function of time and distance and also made GUI of every problem.
Travelling-Salesman-Problem-using-Linear-Programming
Solving the Travelling Salesman Problem (TSP) using linear programming algorithm
Personal-Webpages
Pages include basics of HTML , CSS , Php, Javascript and Sql
Travelling-Salesman-Problem-using-Dynamic-Programming
Solving the Travelling Salesman Problem (TSP) using dynamic programming algorithm
Travelling-Salesman-Problem-using-Genetic-Algorithm
Solving the Travelling Salesman Problem (TSP) using genetic algorithm
Travelling-Salesman-problem-using-Simulated-Annealing
Solving the Travelling Salesman Problem (TSP) using Simulated Annealing Algorithm