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

Azi, 2007, An exact algorithm for a single-vehicle routing problem with time windows and multiple routes, European Journal of Operational Research, 178, 755, 10.1016/j.ejor.2006.02.019 Bärmann, 2015, Solving network design problems via iterative aggregation, Mathematical Programming Computation, 7, 189, 10.1007/s12532-015-0079-1 Boland, 2015, The continuous time service network design problem Caprara, 2015, Friendly bin packing instances without integer round-up property, Mathematical Programming Series A and B, 150, 5, 10.1007/s10107-014-0791-z de Carvalho, 2002, LP models for bin packing and cutting stock problems, European Journal of Operational Research, 141, 253, 10.1016/S0377-2217(02)00124-8 Christophides, 1981, State-space relaxation procedures for the computation of bounds to routing problems, Networks, 11, 145, 10.1002/net.3230110207 Delorme, 2016, Bin packing and cutting stock problems: mathematical models and exact algorithms, European Journal of Operational Research, 255, 1, 10.1016/j.ejor.2016.04.030 Elhallaoui, 2010, Multi-phase dynamic constraint aggregation for set partitioning type problems, Mathematical Programming, 123, 345, 10.1007/s10107-008-0254-5 Elhallaoui, 2005, Dynamic aggregation of set-partitioning constraints in column generation, Operations Research, 53, 632, 10.1287/opre.1050.0222 Garey, 1978, “strong” NP-completeness results: motivation, examples, and implications, Journal of the Association for Computing Machinery, 25, 499, 10.1145/322077.322090 Glover, 1968, Surrogate constraints, Operations Research, 16, 741, 10.1287/opre.16.4.741 Lancia, 2011, A time-indexed LP-based approach for min-sum job-shop problems, Annals of Operations Research, 186, 175, 10.1007/s10479-010-0832-9 Macedo, 2010, Arc-flow model for the two-dimensional guillotine cutting stock problem, Computers & Operations Research, 37, 991, 10.1016/j.cor.2009.08.005 Macedo, 2011, Solving exactly the vehicle routing problem with time windows and multiple routes using a pseudo-polynomial model, European Journal of Operational Research, 214, 457, 10.1016/j.ejor.2011.04.037 Pessoa, 2010, Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems, Mathematical Programming Computation, 2, 1, 10.1007/s12532-010-0019-z Righini, 2008, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, 51, 155, 10.1002/net.20212 Rogers, 1991, Aggregation and disaggregation techniques and methodology in optimization, Operations Research, 39, 553, 10.1287/opre.39.4.553 Solomon, 1987, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, 35, 254, 10.1287/opre.35.2.254 Voge, 2012, Theoretical investigation of aggregation in pseudo-polynomial network-flow models, vol. 7422, 213