Algorithms for Packing Squares: A Probabilistic Analysis

DOI10.1137/0218011MaRDI QIDQ3823793zbMATH OpenOpenAlexFDO

Authors Jeffrey C. Lagarias, E. G. jun. Coffman

Publication date 1989

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0218011

zbMATH Keywords

bin packingpacking squaresprobabilistic performancestrip packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An approximation algorithm for square packing.
• Probabilistic analysis of shelf algorithms for strip packing
• Probabilistic analysis of a new class of strip packing algorithms
• Dynamic, first-fit packings in two or more dimensions
• Packings in two dimensions: Asymptotic average-case analysis of algorithms

Cited in

(14)

• An application of simulated annealing to the cutting stock problem
• Packing problems
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• An algorithm for packing squares
• Cube packing.
• Exact algorithms for the guillotine strip cutting/packing problem.
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH
• Probabilistic analysis of a new class of strip packing algorithms
• On a Square Packing Problem
• scientific article; zbMATH DE number 5732394 (Why is no real title available?)
• Dynamic, first-fit packings in two or more dimensions
• The Maximum of a Random Walk and Its Application to Rectangle Packing
• Average-case analysis of cutting and packing in two dimensions
• An approximation algorithm for square packing.

This page was built for publication: Algorithms for Packing Squares: A Probabilistic Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823793)