Cellular arrangement problems with random flows

In VLSI design, manufacturing systems, architectural floorplan generation, urban and suburban neighborhood configurations, the problem of integrating the layout of cell nodes and routing links is extremely complex. In this paper, configuration of the topology of a set of cells in the plane where random flows occur between the cells is analyzed. The problem is formulated as a Quadratic Set Packing Problem on a graph and a branch and bound algorithm together with supporting computational experience is presented.