A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: J.Mitev / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4014467 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
two-dimensional layout | |||
| Property / zbMATH Keywords: two-dimensional layout / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
probabilistic analysis | |||
| Property / zbMATH Keywords: probabilistic analysis / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
stock cutting | |||
| Property / zbMATH Keywords: stock cutting / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristic | |||
| Property / zbMATH Keywords: heuristic / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strip packing | |||
| Property / zbMATH Keywords: strip packing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
relaxation | |||
| Property / zbMATH Keywords: relaxation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
recursive knapsack operating | |||
| Property / zbMATH Keywords: recursive knapsack operating / rank | |||
Normal rank | |||
Revision as of 18:21, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-phase heuristic for strip packing: Algorithm and probabilistic analysis |
scientific article |
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
