This is the release of the TSP (Traveling Salesman Problem) solver in C++ which uses the powerful IBM Cplex Studio & Concert librairies.
This release implements the Lazy Callback, as stated in the paper mentionned in the README.md.
This callback is fired as soon as the solver finds a solution, this solution is then analyzed in order to check if it does not break the SECs (Subtour Elimination Constraints). These SECs are exponential (2^n), and this implementation allows to enforce the SECs only where needed (i.e. if a solution violates it), which is much faster and it provides the same results according to my tests.