m-Travelling Salesmen linear MIP with Julia
-
Updated
May 13, 2019 - Julia
m-Travelling Salesmen linear MIP with Julia
Sweep algorithm (developed by Gillett and Miller) for the capacitated vehicle routing problem.
Solve DNN relaxations of nonconvex quadratic programming problems.
Solving the traveling salesman problem using the Gurobi Solver, the farthest insertion algorithm, the nearest neighbor algorithm and, finally, using the 2-opt optimization method.
Add a description, image, and links to the optimization-problem topic page so that developers can more easily learn about it.
To associate your repository with the optimization-problem topic, visit your repo's landing page and select "manage topics."