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

Inventory-routing problem (IRP) branch-and-cut algorithm using C++ Gurobi's API and CVRPSEP package

A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem

Solving Elementary Longest/Shortest Path problems with Integer Programming

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

TSP optimization, Operations Research 2 project, UniPD 2022/23

Branch-and-Cut method for solving CVRP using CVRPSEP routines and CPLEX generic callback

discrete optimization problem example with coinMP

An exact semidefinite programming (SDP) based solver for L2-norm semi-supervised support vector machine (S3VM) models.

Open-source implementation accompanying the paper "Branch-and-Cut for Mixed-Integer Linear Decision-Dependent Robust Optimization" by Henri Lefebvre, Martin Schmidt, Simon Stevens and Johannes Thürauf.

Branch and Cut for the Traveling Salesman Problem with the min-cut separation