An efficient interior point approach for QP and LP models of the relative placement problem

Cell placement can be performed using a combination of mathematical programming, graph partitioning and iterative improvement techniques. Mathematical programming provides the relative positions of cells throughout the placement area while ignoring several placement restrictions. We describe quadratic and linear program formulations for finding relative cell positions. Moreover, we demonstrate that both formulations can be solved using an interior point method. Numerical results are presented to demonstrate the effectiveness of the formulations and the solution methodology