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, issue.3, pp.755-766, 2007.
DOI : 10.1016/j.ejor.2006.02.019

A. Bärmann, F. Liers, A. Martin, M. Merkert, C. Thurner et al., Solving network design problems via iterative aggregation, Mathematical Programming Computation, vol.10, issue.2, pp.189-217, 2015.
DOI : 10.1007/s12532-015-0079-1

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, vol.171, issue.1, pp.5-17, 2015.
DOI : 10.1007/s10107-014-0791-z

N. Christophides, A. Mingozzi, and P. Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks, vol.4, issue.2, pp.145-164, 1981.
DOI : 10.1002/net.3230110207

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.
DOI : 10.1016/S0377-2217(02)00124-8

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.
DOI : 10.1016/j.ejor.2016.04.030

I. Elhallaoui, A. Metrane, F. Soumis, and G. Desaulniers, Multi-phase dynamic constraint aggregation for set partitioning type problems, Mathematical Programming, vol.2, issue.3, pp.345-370, 2010.
DOI : 10.1007/s10107-008-0254-5

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.
DOI : 10.1287/opre.1050.0222

M. Garey and D. Johnson, `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications, Journal of the ACM, vol.25, issue.3, pp.499-508, 1978.
DOI : 10.1145/322077.322090

F. Glover, Surrogate Constraints, Operations Research, vol.16, issue.4, pp.741-749, 1968.
DOI : 10.1287/opre.16.4.741

G. Lancia, F. Rinaldi, and P. Serafini, A time-indexed LP-based approach for min-sum job-shop problems, Annals of Operations Research, vol.35, issue.1, pp.175-198, 2011.
DOI : 10.1007/s10479-010-0832-9

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.
DOI : 10.1016/j.cor.2009.08.005

R. Macedo, C. Alves, J. V. De-carvalho, F. Clautiaux, and S. Hanafi, Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model, European Journal of Operational Research, vol.214, issue.3, pp.457-545, 2011.
DOI : 10.1016/j.ejor.2011.04.037
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.4, issue.2, pp.1-32, 2010.
DOI : 10.1007/s12532-010-0019-z

G. Righini and M. Salani, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, vol.3, issue.3, pp.155-170, 2008.
DOI : 10.1002/net.20212

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.
DOI : 10.1287/opre.39.4.553

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.
DOI : 10.1287/opre.35.2.254

M. Voge and F. Clautiaux, Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models, ISCO 2012, 2nd International Symposium on Combinatorial Optimization, pp.213-224, 2012.
DOI : 10.1007/978-3-642-32147-4_20