3
$\begingroup$

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?

Improve this question
$\endgroup$

1 Answer 1

Reset to default
3
$\begingroup$

There are some useful resources to use Gurobi and its callback functions to do that. In the following the first is based on Java and the second one is based on Python which can be translated to its Java equivalent.

Also, you might find out other helpful examples by googling, specifically, on GitHub.

Improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.