Multi-row intersection cuts based on the infinity norm

Split cuts from sparse disjunctions

Permutations in the factorization of simplex bases

The (not so) Trivial Lifting Problem in Two dimensions

A joint vehicle routing and speed optimization problem

Numerically safe lower bounds for the Capacitated Vehicle Routing Problem

Floating point calculations are intrinsically subject to error. In the context of integer programming, these errors may lead to incorrect decisions in the branch-and-bound process, ultimately leading to incorrect optimal solutions. The typical …

A disjunctive convex programming approach to the pollution-routing problem

A branch-cut-and-price algorithm for the energy minimization vehicle routing problem

Branch-and-Cut and Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem

On the exact separation of mixed integer knapsack cuts