A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Fabien Chauny / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Loulou, Richard / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: François Soumis / rank | |||
Normal rank | |||
Revision as of 19:19, 9 February 2024
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
