Probabilistic analysis of a new class of strip packing algorithms

DOI10.1134/S0965542511100071MaRDI QIDQ2901108zbMATH OpenOpenAlexFDO

Authors A. I. Pospelov, N. N. Kuzyurin

Publication date 16 July 2012

Published in Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0965542511100071

zbMATH Keywords

approximate algorithmsprobabilistic analysisstrip packing

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Probabilistic analysis of shelf algorithms for strip packing
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• Approximate algorithms to pack rectangles into several strips
• Algorithms for Packing Squares: A Probabilistic Analysis
• On-line algorithms for packing rectangles into several strips

Cited in

(4)

• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
• Algorithms for Packing Squares: A Probabilistic Analysis
• Probabilistic analysis of shelf algorithms for strip packing

This page was built for publication: Probabilistic analysis of a new class of strip packing algorithms

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