Tabu search for the k-graph partitioning problem

Summary form only given. The graph-partitioning problem (GPP), in its various incarnations, has extensive applications in VLSI design, parallel computing, network planning and other areas. A higher-level heuristic procedure 'tabu search' is studied to provide good solutions to GPP. Four variants are proposed and experimentally compared.