A solver to find a solution of the 2D rectangle packing problem by simulated annealing (SA) optimization.
-
Updated
Feb 12, 2022 - Python
A solver to find a solution of the 2D rectangle packing problem by simulated annealing (SA) optimization.
Pack multiple images of different sizes or formats into one image.
Combinatiorial Optimization applied to the rectangle packing problem, using Minizinc and Z3 solvers
This project analyzes various gate packing algorithms, focusing on the Tetris-based algorithm. It achieves superior space optimization compared to more complex methods like the Sleator algorithm, in spite of its simple implementation. The project features visualizations and performance comparisons across multiple test cases.
An application of constraint programming and satisfiability modulo theories to the NP-complete problem known as optimal rectangle packing
Add a description, image, and links to the rectangle-packing topic page so that developers can more easily learn about it.
To associate your repository with the rectangle-packing topic, visit your repo's landing page and select "manage topics."