A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169)
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: A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale |
scientific article; zbMATH DE number 6107607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale |
scientific article; zbMATH DE number 6107607 |
Statements
A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (English)
0 references
15 November 2012
0 references
dynamic quantity discount
0 references
all-units discount
0 references
dynamic programming
0 references
branch-and-bound
0 references
lot sizing with resale
0 references
time complexity function
0 references
0 references
0 references
0 references
0 references
0 references
0.8710521459579468
0 references
0.868506669998169
0 references
0.8522059917449951
0 references
0.8253381252288818
0 references
