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

Abstract

Full Citation:

Petrica C. Pop, Bin Hu, Günther R. Raidl. A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 219–226, 2013, Springer.

Günther Raidl

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