A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs - Archive ouverte HAL
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

Domaines

Recherche opérationnelle [math.OC]

Bernard Penz  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-00699612

Soumis le : lundi 21 mai 2012-12:52:18

Dernière modification le : jeudi 4 avril 2024-18:22:27

Consulter sur la plateforme ISTEX

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UGA CNRS G-SCOP G-SCOP_OSP_ROSP G-SCOP_OSP TDS-MACS
69 Consultations
0 Téléchargements

Altmetric

Partager

More