Two-Way Partitioning (Kernighan & Lin)
Consider the set S of 2n vertices, all of equal size for now, with an associated cost matrix
Assume C is symmetric and
We want to partition S into two subsets A and B, each with n points, such that the external cost
Start with any arbitrary partition [A,B] of S and try to decrease the initial cost T by a series of interchanges of subsets of A and B
When no further improvement is possible, the resulting partition [A’,B’] is a local minimum and has a fairly high probability of being a global minimum with this scheme