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 OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57719493, #quickstatements; #temporary_batch_1711234560214 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57719493 / rank | |||
Normal rank | |||
Revision as of 01:06, 24 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
