Improved lower bounds for the capacitated lot sizing problem with setup times
Authors:
- 1 March 2004
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 32 (2) , 185-195
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing ProblemsManagement Science, 2000
- A minimal algorithm for the multiple-choice knapsack problemEuropean Journal of Operational Research, 1995
- Capacitated lot-sizing and scheduling by Lagrangean relaxationEuropean Journal of Operational Research, 1992
- Analysis of relaxations for the multi-item capacitated lot-sizing problemAnnals of Operations Research, 1990
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable RedefinitionOperations Research, 1987
- An Applications Oriented Guide to Lagrangian RelaxationInterfaces, 1985
- Uncapacitated lot-sizing: The convex hull of solutions1984
- The Multiple-Choice Knapsack ProblemOperations Research, 1979
- Optimal Programming of Lot Sizes, Inventory and Labor AllocationsManagement Science, 1965
- Programming of Economic Lot SizesManagement Science, 1958