Qumeric/tsp-suboptimal

Implementation of some simple TSP solvers (nearest neighbor, ant algortihm, n! bruteforce, annealing imitation, 2.0-optimal, branch and bound (broken ATM))

Travelling Salesman Problem Solvers

Implementation of several algorithms for TSP, namely:

1. Simple bruteforce
2. Branch and bound
3. Ant algorithm
4. Simulated annealing
5. Closest neighbour (O(n^2) and O(n^3) variants)
6. 2-OPT solution (euler cycle on MST)
7. Christofides algorithm

Todo

1. Add unit tests
2. Publish quality/speed analysis

Ideas

• Grouping (just like sqrt-decomposition (https://habrahabr.ru/post/151151)
• Greedy approximation
• Elite ants