This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Partition an \(n \times n\) square into multiple non-congruent integer-sided rectangles. The rectangles must be non-congruent and the side length must be an integer number. Find the least possible length difference between the largest and smallest used rectangle, i.e. make the rectangles as similar as possible. Every rectangle can only be used once . There is related work covering multiple aspects…
- Partition an \(n \times n\) square into multiple non-congruent integer-sided rectangles.
- The rectangles must be non-congruent and the side length must be an integer number.
- Find the least possible length difference between the largest and smallest used rectangle, i.e. make the
rectangles as similar as possible.
- Every rectangle can only be used once.
There is related work covering multiple aspects of the problem and its solution. Here we focus on
a Mixed Integer Programming approach.
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.