Loading [MathJax]/extensions/TeX/upgreek.js
Graph partitioning using genetic algorithms with ODPX | IEEE Conference Publication | IEEE Xplore

Graph partitioning using genetic algorithms with ODPX


Abstract:

In this paper, we study approximate solutions to the extension of the "maximally balanced connected partition problem", whose corresponding decision problem is known to b...Show More

Abstract:

In this paper, we study approximate solutions to the extension of the "maximally balanced connected partition problem", whose corresponding decision problem is known to be /spl Nscr//spl Pscr/-complete. We introduce a genetic algorithm with a new crossover operator, called the "order- and distance-preserving crossover" (ODPX) operator, and we compare the results of our algorithm to a well-known deterministic approximation algorithm.
Date of Conference: 12-17 May 2002
Date Added to IEEE Xplore: 07 August 2002
Print ISBN:0-7803-7282-4
Conference Location: Honolulu, HI, USA

References

References is not available for this document.