A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4014467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-phase heuristic for strip packing: Algorithm and probabilistic analysis |
scientific article; zbMATH DE number 4014467 |
Statements
A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (English)
0 references
1987
0 references
The papeer presents a heuristic algorithm for the so-called strip packing problem-laying out a specified list of rectangular pieces on a rectangular strip of fixed width and minimal length. Linear programming relaxation and recursive knapsack operating are used. Under some conditions on the data the relative deviation from the optimal solution converges to zero as the problem size increases.
0 references
two-dimensional layout
0 references
probabilistic analysis
0 references
stock cutting
0 references
heuristic
0 references
strip packing
0 references
relaxation
0 references
recursive knapsack operating
0 references
0.8523684740066528
0 references
0.8440487384796143
0 references
0.8438541889190674
0 references
0.8409861326217651
0 references
