arXiv (All)
open access
A Sparse Corner-Difference MILP for Minimum Square Tiling
We study the problem of tiling an $N\times N$ square with axis-aligned squares whose side lengths are integers strictly less than $N$, with the objective of minimizing the number of tiles. The standard placement-based exact-cover MILP contains $Θ(N^5)$ placement-to-cell nonzero coefficients and is a
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
- The smallest square tileable by pairwise incomparable integer rectangles#1014129
- An Algebraic Approach to the Arithmetic of Square Tilings#986854
- Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization#1157182
- Complexity and Robustness of Tilings with Random Perturbations#1134019
- The existence of square non-integer Heffter arrays#955830
Record · ID 1035855
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