An effective algorithm for the capacitated single item lot size problem (Q1331619): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90086-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995168503 / rank | |||
Normal rank | |||
Revision as of 02:53, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective algorithm for the capacitated single item lot size problem |
scientific article |
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
