A Memetic Algorithm for the Partition Graph Coloring Problem

Günther Raidl
Günther Raidl

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