Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:joco.0000021938.49750.91 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967277921 / rank | |||
Normal rank | |||
Latest revision as of 09:55, 30 July 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
