A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
1991., IEEE International Sympoisum on Circuits and Systems
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effectively to many NP-hard combinatorial optimization problems.doi:10.1109/iscas.1991.176574 fatcat:u5si6qk2rnguzavtdhao7dyuau