A. Atamtürk and S. Küçükyavuz, Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation, Operations Research, vol.53, issue.4, pp.711-730, 2005.
DOI : 10.1287/opre.1050.0223

A. Atamtürk and S. Küçükyavuz, An algorithm for lot sizing with inventory bounds and fixed costs, Operations Research Letters, vol.36, issue.3, pp.297-299, 2008.
DOI : 10.1016/j.orl.2007.08.004

A. Atamtürk, S. Küçükyavuz, and B. Tezel, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, SIAM Journal on Optimization, vol.27, issue.3, pp.1943-1976, 2017.
DOI : 10.1137/15M1033009

M. Florian, J. K. Lenstra, and A. H. Kan, Deterministic Production Planning: Algorithms and Complexity, Management Science, vol.26, issue.7, pp.669-679, 1980.
DOI : 10.1287/mnsc.26.7.669

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

J. Gutiérrez, A. Sedeño-noda, M. Colebrook, and J. Sicilia, An efficient approach for solving the lot-sizing problem with time-varying storage capacities, European Journal of Operational Research, vol.189, issue.3, pp.682-693, 2008.
DOI : 10.1016/j.ejor.2006.09.096

H. Hwang and H. Jung, Warehouse capacitated lot-sizing for a two-stage supply chain, The 2011 KORMS/KIIE Spring Joint Conference on 26 May, pp.914-917, 2011.

H. Hwang and W. Van, Improved algorithms for a lot-sizing problem with inventory bounds and backlogging, Naval Research Logistics (NRL), vol.14, issue.3-4, pp.3-4244, 2012.
DOI : 10.1287/mnsc.14.7.429

URL : https://repub.eur.nl/pub/18591/EI2010-17.pdf

W. Jaruphongsa, S. Çetinkaya, and C. Lee, Warehouse space capacity and delivery time window considerations in dynamic lot-sizing for a simple supply chain, International Journal of Production Economics, vol.92, issue.2, pp.169-180, 2004.
DOI : 10.1016/j.ijpe.2003.10.012

T. Liu, Economic lot sizing problem with inventory bounds, European Journal of Operational Research, vol.185, issue.1, pp.204-215, 2008.
DOI : 10.1016/j.ejor.2006.12.032

S. F. Love, Bounded Production and Inventory Models with Piecewise Concave Costs, Management Science, vol.20, issue.3, pp.313-318, 1973.
DOI : 10.1287/mnsc.20.3.313

R. A. Melo and L. A. Wolsey, Uncapacitated two-level lot-sizing, Operations Research Letters, vol.38, issue.4, pp.241-245, 2010.
DOI : 10.1016/j.orl.2010.04.001

M. Önal, W. Van-den-heuvel, and T. Liu, A note on ???The economic lot sizing problem with inventory bounds???, European Journal of Operational Research, vol.223, issue.1, pp.290-294, 2012.
DOI : 10.1016/j.ejor.2012.05.019

E. Toczy?owski, An o(t 2 ) algorithm for the lot-sizing problem with limited inventory levels. In Emerging Technologies and Factory Automation, ETFA '95 INRIA/IEEE Symposium on, pp.77-85, 1995.

W. Van-den-heuvel, J. M. Gutiérrez, and H. Hwang, Note on ???An efficient approach for solving the lot-sizing problem with time-varying storage capacities???, European Journal of Operational Research, vol.213, issue.2, pp.455-457, 2011.
DOI : 10.1016/j.ejor.2011.04.002

S. Van-hoesel, H. E. Romeijn, D. R. Morales, and A. P. Wagelmans, Integrated Lot Sizing in Serial Supply Chains with Production Capacities, Management Science, vol.51, issue.11, pp.511706-1719, 2005.
DOI : 10.1287/mnsc.1050.0378

A. Wagelmans and S. Van-hoesel, Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case, Operations Research, vol.40, issue.1-supplement-1, pp.145-156, 1992.
DOI : 10.1287/opre.40.1.S145

URL : https://repub.eur.nl/pub/2310/eur_wagelmans_22.pdf

W. I. , Minimum Concave Cost Flows in Certain Networks, Management Science, vol.14, issue.7, pp.429-450, 1968.
DOI : 10.1287/mnsc.14.7.429

W. I. , A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System???A Network Approach, Management Science, vol.15, issue.9, pp.506-527, 1969.
DOI : 10.1287/mnsc.15.9.506

M. Zhang, S. Küçükyavuz, and H. Yaman, A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands, Operations Research, vol.60, issue.4, pp.918-935, 2012.
DOI : 10.1287/opre.1120.1058