optimize/finch square packing 12
optimize/finch square packing 12: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Place $n = 12$ axis-parallel squares inside the unit square $ 0,1 ^2$ so that no two of them share an interior point (touching along boundaries is allowed), and maximize the sum of their side lengths .
The task
Place $n = 12$ axis-parallel squares inside the unit square $[0,1]^2$ so that no two of them share an interior point (touching along boundaries is allowed), and **maximize the sum of their side lengths**.