A two-phase heuristic for strip packing: Algorithm and probabilistic analysis

DOI10.1016/0167-6377(87)90006-XzbMath0624.90086OpenAlexW2065153455MaRDI QIDQ579140

S. Sadones, Loulou, Richard, Fabien Chauny, François Soumis

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90006-x

zbMATH Keywords

relaxationprobabilistic analysisheuristicstrip packingrecursive knapsack operatingstock cuttingtwo-dimensional layout

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27)

Related Items (1)

A multi-objective programming approach to 1.5-dimensional assortment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• An Introduction to Combinatorial Models of Dynamic Storage Allocation
• Two-dimensional packing: expected performance of simple level algorithms
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation

This page was built for publication: A two-phase heuristic for strip packing: Algorithm and probabilistic analysis