A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem

Petrica C. Pop, Bin Hu, Günther Raidl
January 2013
PDF Cite
Type
Conference Paper
Evolcomp Netdesign
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.