G. Belvaux and L. Wolsey, Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs, Management Science, vol.47, issue.7, pp.993-1007, 2001.
DOI : 10.1287/mnsc.47.7.993.9800
URL : http://hdl.handle.net/2078.1/4098

S. J. Benson, Y. Ye, and X. Zhang, Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization, SIAM Journal on Optimization, vol.10, issue.2, pp.443-461, 2000.
DOI : 10.1137/S1052623497328008

L. Buschkühl, F. Sahling, S. Helber, and H. Tempelmeier, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, OR Spectrum, vol.13, issue.2, pp.231-261, 2010.
DOI : 10.1007/s00291-008-0150-7

G. D. Eppen and M. R. , Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition, Operations Research, vol.35, issue.6, pp.832-848, 1987.
DOI : 10.1287/opre.35.6.832

B. Fleischmann, The discrete lot-sizing and scheduling problem, European Journal of Operational Research, vol.44, issue.3, pp.337-348, 1990.
DOI : 10.1016/0377-2217(90)90245-7

C. Gicquel, N. Mì-egeville, M. Minoux, and Y. Dallery, Discrete lot sizing and scheduling using product decomposition into attributes, Computers & Operations Research, vol.36, issue.9, pp.2690-2698, 2009.
DOI : 10.1016/j.cor.2008.11.017
URL : https://hal.archives-ouvertes.fr/hal-01170200

C. Gicquel, M. Minoux, and Y. Dallery, Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources, International Journal of Production Research, vol.19, issue.9, pp.2587-2603, 2011.
DOI : 10.1287/mnsc.48.12.1587.442
URL : https://hal.archives-ouvertes.fr/hal-01264958

M. W. Goemans and S. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, vol.42, issue.6, pp.1115-1145, 1995.
DOI : 10.1145/227683.227684

C. Helmberg, T. Habilitationsschrift, and . Berlin, Semidefinite programming for combinatorial optimization, 2000.

C. Helmberg, F. Rendl, and R. Weismantel, A Semidefinite Programming Approach to the Quadratic Knapsack Problem, Journal of Combinatorial Optimization, vol.4, issue.2, pp.197-215, 2000.
DOI : 10.1023/A:1009898604624

C. Helmberg and F. Rendl, A Spectral Bundle Method for Semidefinite Programming, SIAM Journal on Optimization, vol.10, issue.3, pp.673-696, 2000.
DOI : 10.1137/S1052623497328987

C. Helmberg, Semidefinite programming, European Journal of Operational Research, vol.137, issue.3, pp.461-482, 2002.
DOI : 10.1016/S0377-2217(01)00143-6

R. Jans and Z. Degraeve, Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches, European Journal of Operational Research, vol.177, issue.3, pp.1855-1875, 2007.
DOI : 10.1016/j.ejor.2005.12.008

B. Lovász and A. Schrijver, Cones of Matrices and Set-Functions and 0???1 Optimization, SIAM Journal on Optimization, vol.1, issue.2, pp.66-190, 1991.
DOI : 10.1137/0801013

F. Roupin, From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems, Journal of Combinatorial Optimization, vol.8, issue.4, pp.469-493, 2004.
DOI : 10.1007/s10878-004-4838-6
URL : https://hal.archives-ouvertes.fr/hal-00596181

M. Salomon, M. Solomon, L. Van-wassenhove, Y. Dumas, and S. Dauzère-pérès, Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows, European Journal of Operational Research, vol.100, issue.3, pp.494-513, 1997.
DOI : 10.1016/S0377-2217(96)00020-3

H. D. Sherali and W. P. Adams, A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.411-430
DOI : 10.1137/0403036

C. A. Van-eijl and C. P. Van-hoesel, On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs, Operations Research Letters, vol.20, issue.1, pp.7-13, 1997.
DOI : 10.1016/S0167-6377(96)00043-0