The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q57186020, #quickstatements; #temporary_batch_1714653054045 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57186020 / rank | |||
Normal rank | |||
Revision as of 13:34, 2 May 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
