We have a group project and our job is to create an algorithm for solving a TSP with Branch and Cut. (Use of lazy constraints.) We tried around but don´t know what is the best way to start. We get the first solution with the nearest neighbor heuristic. From there on we should start with the solution. We should use the Gurobi solver.
What is the best way to get through this?