Probabilistic analysis of shelf algorithms for strip packing

DOI10.1515/156939206776241228zbMath1121.68127OpenAlexW2111924023MaRDI QIDQ5491239

A. I. Pospelov, Nikolaj Nikolaevich Kuzyurin

Publication date: 10 October 2006

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939206776241228

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Randomized algorithms (68W20)

Related Items (1)

Numerical optimization method for packing regular convex polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal rectangle packing
• A 2.5 times optimal algorithm for packing in two dimensions
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• On the sum-of-squares algorithm for bin packing
• Shelf Algorithms for Two-Dimensional Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing

This page was built for publication: Probabilistic analysis of shelf algorithms for strip packing