Exact solutions for two-dimensional bin packing problems by branch-and-cut
Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
Algorithms for the Orienteering Problem
A branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP)
[NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
Inventory-routing problem (IRP) branch-and-cut algorithm using C++ Gurobi's API and CVRPSEP package
Solving Elementary Longest/Shortest Path problems with Integer Programming
Branch-and-cut solver for the Capacitated Profitable Tour Problem (CPTP)
A recombination-based matheuristic for mixed integer programming problems with binary variables
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming
Solver for Maximum Cut and QUBO problems
MATLAB implementation of a branch-and-cut algorithm for the Asymmetric Travelling Salesman Problem (ATSP), using the Gurobi solver with degree constraints and subtour-elimination constraints separated via an integer-programming (ILP) separation problem. Operations research / integer programming.
Branch-and-Cut method for solving CVRP using CVRPSEP routines and CPLEX generic callback
TSP optimization, Operations Research 2 project, UniPD 2022/23
A high-performance C++ algorithmic solver for Heterogeneous Fleet Routing and Dial-a-Ride Problems (DARP) utilizing ALNS, VNS, and Branch-and-Cut.
A from-scratch branch-and-cut MIP solver in C++23 with Python bindings
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."