discrete optimization problem example with coinMP
-
Updated
Apr 26, 2015 - C++
discrete optimization problem example with coinMP
Solving Elementary Longest/Shortest Path problems with Integer Programming
Optimal Weighted Graph Matching
Branch and Cut for the Traveling Salesman Problem with the min-cut separation
Inventory-routing problem (IRP) branch-and-cut algorithm using C++ Gurobi's API and CVRPSEP package
Algorithms for the Orienteering Problem
Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
Exact solutions for two-dimensional bin packing problems by branch-and-cut
A branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP)
A recombination-based matheuristic for mixed integer programming problems with binary variables
The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
Used cplex callback function to control branch and cuts behavior in cplex
TSP optimization, Operations Research 2 project, UniPD 2022/23
C++ Nonisomorphic Branch-and-Cut
Branch-and-Cut method for solving CVRP using CVRPSEP routines and CPLEX generic callback
[NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
An Exact Solver for Cardinality-constrained Minimum Sum-of-Squares Clustering
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."