The purpose of this homepage is to make available to researchers Robust-Branch-Cut-&-Price codes for several combinatorial optimization problems.
The first code available is for solving the Capacitated Vehicle Routing Problem (CVRP). Extensions will also be available soon.