A Fast Genetic Algorithm for the Max Cut-Clique Problem.

Giovanna Fortez Franco Robledo Pablo Romero Omar Viera

Published in: LOD (1) (2020)

Keyphrases

max cut
genetic algorithm
planar graphs
graph model
np hard
fitness function
np complete problems
graph partitioning
genetic algorithm ga
spectral graph
genetic programming
evolutionary algorithm
min max
multi objective
particle swarm optimization
graph coloring
language model
simulated annealing