Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600)
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: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems |
scientific article; zbMATH DE number 2146076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems |
scientific article; zbMATH DE number 2146076 |
Statements
Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (English)
0 references
15 March 2005
0 references
cutting stock
0 references
depth-first search
0 references
dynamic programming
0 references
hill-climbing
0 references
heuristics
0 references
knapsacking
0 references
0.9124565
0 references
0.89877474
0 references
0.8984579
0 references
0.8969722
0 references
0.8968734
0 references
0.8962985
0 references
0 references
0.8951372
0 references
