A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs. - Bertrand Hellion; Fabien Mangione; Bernard Penz (Eur. J. Oper. Res., 2012)

Corrigendum to "A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs" [Eur. J. Oper. Res. (2012) 10-16]. - Bertrand Hellion; Fabien Mangione; Bernard Penz (Eur. J. Oper. Res., 2013)

A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows. - Bertrand Hellion; Fabien Mangione; Bernard Penz (Oper. Res. Lett., 2014)