The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(98)00163-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967335485 / rank | |||
Normal rank | |||
Latest revision as of 08:38, 30 July 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
