An efficient optimal algorithm for the quantity discount problem in material requirement planning (Q1000957): 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/j.cor.2008.05.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969742752 / rank | |||
Normal rank | |||
Revision as of 18:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient optimal algorithm for the quantity discount problem in material requirement planning |
scientific article |
Statements
An efficient optimal algorithm for the quantity discount problem in material requirement planning (English)
0 references
12 February 2009
0 references
branch and bound
0 references
inventory
0 references
lot sizing
0 references
purchasing
0 references
all-units discount
0 references
