Algorithms for Packing Squares: A Probabilistic Analysis

DOI10.1137/0218011zbMath0671.68014OpenAlexW2083167669MaRDI QIDQ3823793

Jeffrey C. Lagarias, Edward 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 packingstrip packingpacking squaresprobabilistic performance

Mathematics Subject Classification ID

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

Related Items

An application of simulated annealing to the cutting stock problem, Cube packing., Exact algorithms for the guillotine strip cutting/packing problem., Packing problems, Packings in two dimensions: Asymptotic average-case analysis of algorithms, Average-case analysis of cutting and packing in two dimensions, The Maximum of a Random Walk and Its Application to Rectangle Packing