A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2012

A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs

Dates et versions

hal-00699612 , version 1 (21-05-2012)

Identifiants

Citer

Bertrand Hellion, Fabien Mangione, Bernard Penz. A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs. European Journal of Operational Research, 2012, 222 (1), pp.10-16. ⟨10.1016/j.ejor.2012.04.024⟩. ⟨hal-00699612⟩
61 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More