Best packing of rods into boxes

DOI10.1016/0012-365X(94)00020-JzbMath0832.05025OpenAlexW1992656280WikidataQ126321411 ScholiaQ126321411MaRDI QIDQ1896361

F. W. Barnes

Publication date: 20 February 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00020-j

zbMATH Keywords

boxpackingrodsflakes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial aspects of packing and covering (05B40)

Related Items

On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ A new quasi-human algorithm for solving the packing problem of unit equilateral triangles

Cites Work

• Unnamed Item
• On packing squares with equal squares
• Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
• How many \(1\times 2\times 4\) bricks can you get into an odd box?
• Packing boxes with harmonic bricks
• Algebraic theory of brick packing. II
• Barring rectangles from the plane

This page was built for publication: Best packing of rods into boxes