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

•We propose a new framework for managing pseudo-polynomial integer linear programs.•The quality of the approximations obtained is analyzed.•The method outperforms the best methods from the literature on two hard combinatorial problems.