SOLVING THE MAXIMALLY BALANCED CONNECTED PARTITION PROBLEM IN GRAPHS BY USING GENETIC ALGORITHM

Abstract

This paper exposes a research of the NP-hard Maximally Balanced Con- nected Partition problem (MBCP). The proposed solution comprises of a genetic algorithm (GA) that uses: binary representation, fine-grained tournament selection,