Algorithms
Traveling Salesman Problem
Using Python 2.7 to explore algorithms to solve or approximate the Traveling Salesman Problem
Contents
- Nearest Neighbor Approach:
- Greedy Algorithm with 2D Adjacency Matrix
- Greedy Algorithm using kd-Tree
- Minimum Spanning Tree Approach