This code was produced as part of a mini-project for a course at EPFL entiteled "Convex Optimization and Applications". It is written entirely in MATLAB.
Floor planning is an optimization problem that aims to find an optimal placement of rectangles given their individual areas. The problem is NP hard in general. Here, a greedy approach is used to turn it into a convex problem which is then solved with the CVX library. Detailed study of the problem and the presented solution can be found in my project report.
Check out sampleTest1.m for a walkthrough of all important steps.