An effective algorithm for the capacitated single item lot size problem (Q1331619)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective algorithm for the capacitated single item lot size problem |
scientific article; zbMATH DE number 622635
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective algorithm for the capacitated single item lot size problem |
scientific article; zbMATH DE number 622635 |
Statements
An effective algorithm for the capacitated single item lot size problem (English)
0 references
21 August 1994
0 references
deterministic, single product capacitated dynamic lot size model
0 references
growth constraint
0 references
dynamic programming
0 references
branch-and-bound
0 references
NP-hard
0 references
0 references
0 references
0 references
0 references
0 references
0 references
