Comes up in circuit design and other ``layout'' problems.
Given a graph, how split it into two pieces so as to minimize the number of edges the cross between the pieces.
How can you optimize this?
Penalty introduced for imbalance.
Search space? Local moves? Selection rule? Restart rule?
