The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:53, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming |
scientific article |
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
