An exact approach for aggregated formulations

Aggregating formulations is a powerful approach for problems to take on tractable forms. Aggregation may lead to loss of information, i.e. the aggregated formulation may be an approximation of the original problem. In branch-and-bound context, aggregation can also complicate branching, e.g. when optimality cannot be guaranteed by branching on aggregated variables.
We present a generic exact solution method to remedy the drawbacks of aggregation. It combines the original and aggregated formulations and applies Benders' decomposition. We apply the method to the Split Delivery Vehicle Routing Problem.