A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985): 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.1007/s10479-008-0457-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969732427 / rank | |||
Normal rank | |||
Revision as of 01:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem |
scientific article |
Statements
A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (English)
0 references
13 December 2010
0 references
cutting and packing problems
0 references
constrained two-dimensional guillotine cutting patterns
0 references
dynamic programming
0 references
and/or-graph search
0 references
heuristics
0 references
