Concepedia

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

Jozef Kratica, D.V. Tošić, Vladimir Filipović

Computing and Informatics / Computers and Artificial Intelligence · 2008 · 22 citations · 9 references

Concepts

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,

References

9

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

Ivana Ljubić, René Weiskircher, Ulrich Pferschy et al. · Mathematical Programming · 2005 · 233 citations

, , +11

Approximating the maximally balanced connected partition problem in graphs

Janka Chlebı́ková · Information Processing Letters · 1996 · 94 citations

, , +8

Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Günther R. Raidl, Jens Gottlieb · Evolutionary Computation · 2005 · 91 citations

, , +15

Fine-grained Tournament Selection Operator in Genetic Algorithms

Vladimir Filipović · Computing and Informatics / Computers and Artificial Intelligence · 2003 · 72 citations

, , +9

Improving performances of the genetic algorithm by caching

Jozef Kratica · Computing and Informatics / Computers and Artificial Intelligence · 1999 · 65 citations

, , +15