Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints

The computational experiments on two hard optimization problems (a variant of the vehicle routing problem and the cutting-stock problem) show that a generic implementation of the proposed framework allows us to outperform previous known methods.