arXiv (All)
open access
An exact formula for optimal axis-parallel packing of eight squares
We determine the smallest square container for eight axis-parallel squares of prescribed side lengths. The optimal side length is the minimum of the costs of 23 explicit packing strategies, and each cost is a maximum of sums of side lengths. No minimum of fewer convex functions represents it. Three
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Maximum Linear Arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs#1187194
- New mixed cages, bounds and computational results#1324711
- Four figure mathematical tables: comprising logarithmic and trigonometrical tables, and tables of squares, square roots, and reciprocals ..#646014
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts#430004
- Cutting along a symmetric quadrilateral to construct an embedded flexible dodecahedron#971714
Record · ID 1412564
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive