What? - Project Description
-
Solve an intractable problem that is of practical importance
-
Implement an exact branch-and-bound algorithm for TSP
-
Implement heuristic algorithms for TSP (without approximation guarantees)
-
Implement approximate algorithms for TSP, that run in reasonable time and provide high-quality solutions
-
Develop your ability to conduct empirical analysis of algorithm performance on datasets, and to understand the trade-offs between accuracy, speed, etc., across different algorithms
-
Work in group with other students
Source : xkcd
Report should be an interesting read for you.
Richard, Ran, Vikas & Ashwini {@gatech}
Don't Care. Feel free to fix it though :)