Routing

A joint vehicle routing and speed optimization problem

Exact algorithms for the chance-constrained vehicle routing 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

Exact algorithms for the chance-constrained vehicle routing problem

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

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm

Robust branch-and-cut-and-price for the Capacitated Vehicle Routing Problem

Robust branch-and-cut-and-price for the capacitated vehicle routing problem