The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373)
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: The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming |
scientific article; zbMATH DE number 1319524
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming |
scientific article; zbMATH DE number 1319524 |
Statements
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (English)
0 references
2 August 1999
0 references
industrial applications
0 references
industrial cutting stock problems
0 references
dynamic programming
0 references
0.9031475
0 references
0.89993864
0 references
0 references
0.8873708
0 references
0.88733715
0 references
0.8865003
0 references
0.8813721
0 references
0.8813218
0 references
