Solving NP-Complete Problems With Networks of Evolutionary Processors.

Juan Castellanos Carlos Martín-Vide Victor Mitrana José M. Sempere

Published in: IWANN (1) (2001)

Keyphrases

np complete problems
np complete
graph coloring
phase transition
sat problem
hard problems
constraint satisfaction problems
job shop scheduling
np hard
randomly generated
computational complexity
dynamic programming
scheduling problem
satisfiability problem
objective function
constraint satisfaction