Branch-and-Cut method for solving CVRP using CVRPSEP routines and CPLEX generic callback
-
Updated
Feb 28, 2024 - C++
Branch-and-Cut method for solving CVRP using CVRPSEP routines and CPLEX generic callback
C++ Nonisomorphic Branch-and-Cut
Used cplex callback function to control branch and cuts behavior in cplex
The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits
A recombination-based matheuristic for mixed integer programming problems with binary variables
A branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP)
Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
Inventory-routing problem (IRP) branch-and-cut algorithm using C++ Gurobi's API and CVRPSEP package
Branch and Cut for the Traveling Salesman Problem with the min-cut separation
Solving Elementary Longest/Shortest Path problems with Integer Programming
discrete optimization problem example with coinMP
Add a description, image, and links to the branch-and-cut topic page so that developers can more easily learn about it.
To associate your repository with the branch-and-cut topic, visit your repo's landing page and select "manage topics."