Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem |
scientific article; zbMATH DE number 5607540
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem |
scientific article; zbMATH DE number 5607540 |
Statements
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (English)
0 references
25 September 2009
0 references
combinatorial optimization
0 references
cutting problems
0 references
dynamic programming
0 references
single constrained knapsack problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
