We want to connect $n$ modules by wires. The distance between two position $i, k$ is $a_{ik}$. $b_{jl}$ is the number of connections between module $j$ and $l$. Now we're looking for an assignment of the modules to their positions so that the total wire length is minimal.
I need to formulate a models that represents this problem, $\min f(x) = ?$.
How could this be done? The total wire length is minimal iff the number of connections and the sum of the length of connections is minimal. How could I express this? Thanks!