A. Agra and M. F. Constantino, Description of 2-integer continuous knapsack polyhedra. Discrete Optimization, pp.95-110, 2006.

A. Agra and M. F. Constantino, Lifting two-integer knapsack inequalities, Mathematical Programming, pp.115-154, 2007.
DOI : 10.1007/s10107-006-0705-9

E. Balas, Disjunctive Programming, Annals of Discrete Mathematics, vol.5, pp.3-51, 1979.
DOI : 10.1016/S0167-5060(08)70342-X

M. Conforti and G. Zambelli, The Mixing Set with Divisible Capacities, 2008.
DOI : 10.1007/978-3-540-68891-4_30

M. Conforti, M. D. Summa, and L. A. Wolsey, The Mixing Set with Divisible Capacities, Lecture Notes in Computer Science, vol.5035, pp.435-449, 2008.
DOI : 10.1007/978-3-540-68891-4_30

M. Constantino, A Polyhedral Approach to Production Planning Models: Start-up Costs and Times, and Lower Bounds on Production, Faculté des Sciences, 1995.

M. Constantino, Lower Bounds in Lot-Sizing Models: A Polyhedral Study, Mathematics of Operations Research, vol.23, issue.1, pp.101-118, 1998.
DOI : 10.1287/moor.23.1.101

R. E. Gomory, An algorithm for the mixed integer problem The RAND Corporation, 1960.

O. Günlük and Y. Pochet, Mixing MIR inequalities for mixed integer programs, Mathematical Programming, pp.429-258, 2001.

M. and D. Summa, The mixing set with divisible capacities. Working Paper, 2007.

A. J. Miller and L. A. Wolsey, Tight formulations for some simple mixed integer programs and convex objective integer programs, Mathematical Programming, vol.98, issue.1-3, pp.73-88, 2003.
DOI : 10.1007/s10107-003-0397-3
URL : https://hal.archives-ouvertes.fr/hal-00387111

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372
URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

Y. Pochet and L. A. Wolsey, Lot-Sizing with Constant Batches: Formulation and Valid Inequalities, Mathematics of Operations Research, vol.18, issue.4, pp.767-785, 1993.
DOI : 10.1287/moor.18.4.767

Y. Pochet and L. A. Wolsey, Polyhedra for lot-sizing with Wagner???Whitin costs, Mathematical Programming, pp.297-323, 1994.
DOI : 10.1007/BF01582225

M. Van-vyve, A Solution Approach of Production Planning Problems based on Compact Formulations for Single-Item Lot-Sizing Models, 2003.

M. Zhao and I. R. De-farias, The mixing-MIR set with divisible capacities, Mathematical Programming, 2007.
DOI : 10.1007/s10107-007-0140-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.3613

M. Zhao and I. R. De-farias, The mixing-MIR set with two nondivisible capacities, 2007.
DOI : 10.1007/s10107-007-0140-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.3613

M. Zhao and I. R. De-farias, A note on the continuous mixing polyhedron, 2007.