Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems (Q5952054)
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 1687628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems |
scientific article; zbMATH DE number 1687628 |
Statements
Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems (English)
0 references
8 January 2002
0 references
combinatorial optimization
0 references
cutting problems
0 references
stock rectangle
0 references
dynamic programming
0 references
single knapsack problem
0 references
optimality
0 references
0.8812509179115295
0 references
0.8801394701004028
0 references
0.865789532661438
0 references
0.865789532661438
0 references
0.8425042629241943
0 references
