, R204 858,22 1 900* 1 900* 1 900* 1 249,7 1 900* 1 900* 1 169,2 2 900* 1, vol.134, p.7, 0118.

, C203 1088, vol.38, p.9, 0122.

. Avg, , vol.1, 0345.

N. Azi, M. Gendreau, and J. Potvin, An exact algorithm for a single-vehicle routing problem with time windows and multiple routes, European Journal of Operational Research, vol.178, pp.755-766, 2007.

A. Bärmann, F. Liers, A. Martin, M. Merkert, C. Thurner et al., Solving network design problems via iterative aggregation, Mathematical Programming Computation, vol.7, issue.2, pp.189-217, 2015.

N. Boland, M. Hewitt, L. Marshall, and M. Savelsbergh, The continuous time service network design problem, 2015.

A. Caprara, J. D. Diaz, M. Dell'amico, M. Iori, and R. Rizzi, Friendly bin packing instances without integer round-up property, Mathematical Programming Series A and B, vol.150, pp.5-17, 2015.

N. Christophides, A. Mingozzi, and P. Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks, vol.11, pp.145-164, 1981.

J. M. De-carvalho, LP models for bin packing and cutting stock problems, European Journal of Operational Research, vol.141, issue.2, pp.253-273, 2002.

M. Delorme, M. Iori, and S. Martello, Bin packing and cutting stock problems: Mathematical models and exact algorithms, European Journal of Operational Research, vol.255, issue.1, pp.1-20, 2016.

I. Elhallaoui, A. Metrane, F. Soumis, and G. Desaulniers, Multiphase dynamic constraint aggregation for set partitioning type problems, Mathematical Programming, vol.123, issue.2, pp.345-370, 2010.

I. Elhallaoui, D. Villeneuve, F. Soumis, and G. Desaulniers, Dynamic aggregation of set-partitioning constraints in column generation, Operations Research, vol.53, issue.4, pp.632-645, 2005.

M. Garey and D. Johnson, strong" NP-completeness results: motivation, examples, and implications, Journal of the Association for Computing Machinery, vol.25, pp.499-508, 1978.

F. Glover, Surrogate constraints, Operations Research, vol.16, pp.741-749, 1968.

G. Lancia, F. Rinaldi, and P. Serafini, A time-indexed LP-based approach for min-sum job-shop problems, Annals of Operations Research, vol.186, pp.175-198, 2011.

R. Macedo, C. Alves, and J. V. De-carvalho, Arc-flow model for the two-dimensional guillotine cutting stock problem, Computers & Operations Research, vol.37, issue.6, pp.991-1001, 2010.

R. Macedo, C. Alves, J. V. De-carvalho, F. Clautiaux, and S. Hanafi, Solving exactly the vehicle routing problem with time windows and multiple routes using a pseudo-polynomial model, European Journal of Operational Research, vol.214, issue.3, pp.457-545, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00616366

A. Pessoa, E. Uchoa, M. De-aragão, and R. Rodrigues, Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems, Mathematical Programming Computation, vol.2, pp.1-32, 2010.

G. Righini and M. Salani, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, vol.51, pp.155-170, 2008.

D. F. Rogers, R. D. Plante, R. T. Wong, and J. R. Evans, Aggregation and disaggregation techniques and methodology in optimization, Operations Research, vol.39, issue.4, pp.553-582, 1991.

M. M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.

M. Voge and F. Clautiaux, Theoretical investigation of aggregation in pseudo-polynomial network-flow models, ISCO 2012, 2nd International Symposium on Combinatorial Optimization, vol.7422, pp.213-224, 2012.