A dynamic programming based heuristic for industrial buying of cardboard (Q1111922)
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 dynamic programming based heuristic for industrial buying of cardboard |
scientific article; zbMATH DE number 4076940
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic programming based heuristic for industrial buying of cardboard |
scientific article; zbMATH DE number 4076940 |
Statements
A dynamic programming based heuristic for industrial buying of cardboard (English)
0 references
1989
0 references
A heuristic method is proposed for a deterministic two-dimensional assortment problem with a large number of different sizes. The method is applied using real-world data for cardboard buying. It is found to give satisfactory results in comparison with both the current company policy and results obtained by an existing heuristic.
0 references
heuristic
0 references
deterministic two-dimensional assortment
0 references
real-world data
0 references
