An efficient optimal algorithm for the quantity discount problem in material requirement planning (Q1000957): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by the same user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2008.05.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2008.05.003 / rank | |||
Normal rank | |||
Latest revision as of 12:09, 10 December 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
