Dynamic programming to minimize the maximum number of open stacks (Q2892372)
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 6047477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming to minimize the maximum number of open stacks |
scientific article; zbMATH DE number 6047477 |
Statements
18 June 2012
0 references
dynamic programming
0 references
minimization of maximum number of open stacks
0 references
cutting sequencing
0 references
Dynamic programming to minimize the maximum number of open stacks (English)
0 references
0.7385752201080322
0 references
0.7337214946746826
0 references
0.7295891642570496
0 references
0.7273057103157043
0 references
