Implementation of several algorithms for TSP, namely:
- Simple bruteforce
- Branch and bound
- Ant algorithm
- Simulated annealing
- Closest neighbour (O(n^2) and O(n^3) variants)
- 2-OPT solution (euler cycle on MST)
- Christofides algorithm
- Add unit tests
- Publish quality/speed analysis
- Grouping (just like sqrt-decomposition (https://habrahabr.ru/post/151151)
- Greedy approximation
- Elite ants