The floor layout problem (FLP) asks a designer to position a collection of rectangular boxes on a fixed floor in such a way that minimizes total communication costs between the components. This work presents a framework for generating mixed-integer formulations for the disjunctive optimization problems such as the FLP by “encoding” a union of polyhedra in a higher dimensional space. We present theoretical and computational evidence for the strength of the resulting formulations and valid inequalities.