Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:30, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems |
scientific article |
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
