A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm

Authors
du Merle, O Goffin, JL Trouiller, C Vial, JP
Citation
O. Du Merle et al., A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm, NONC OPTIM, 42, 2000, pp. 380-405
Categorie Soggetti
Current Book Contents","Current Book Contents
Journal title
APPROXIMATION AND COMPLEXITY IN NUMERICAL OPTIMIZATION : CONTINUOUS AND DISCRETE PROBLEMS → ACNP
Volume
42
Year of publication
2000
Pages
380 - 405
Database
ISI
SICI code