M. Laguna, T. Feo and H. Elrod
Operations Research, vol. 42, no. 4, pp. 677-687 (1994)
We present a greedy randomized adaptive search procedure (GRASP) for the network 2-partition problem. The heuristic is empirically compared with the Kernighan-Lin (K&L) method on a wide range of instances. The GRASP to find optimal solutions is assessed by comparing its performance with a general purpose mixed integer programming package.
