Title :
Tabu search for the k-graph partitioning problem
Author :
Hammami, M. ; Ghedira, K.
Author_Institution :
ISG, Tunis, Tunisia
Abstract :
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.
Keywords :
VLSI; graph theory; heuristic programming; optimisation; parallel processing; search problems; telecommunication network planning; GPP; VLSI design; heuristic procedure; k-graph partitioning problem; meta-heuristics; network planning; optimization; parallel computing; tabu search; Parallel processing; Very large scale integration;
Conference_Titel :
Computer Systems and Applications, 2003. Book of Abstracts. ACS/IEEE International Conference on
Conference_Location :
Tunis, Tunisia
Print_ISBN :
0-7803-7983-7
DOI :
10.1109/AICCSA.2003.1227517
