Solving sequential interval cutting problems via dynamic programming (Q1197666)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 91829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving sequential interval cutting problems via dynamic programming |
scientific article; zbMATH DE number 91829 |
Statements
Solving sequential interval cutting problems via dynamic programming (English)
0 references
16 January 1993
0 references
cutting stock
0 references
sequential one-dimensional cutting
0 references
0.8179000020027161
0 references
0.8017962574958801
0 references
0.7948108315467834
0 references
0.7831798791885376
0 references
0.781112015247345
0 references
