Improving IPOG's vertical growth based on a graph coloring scheme.

Feng Duan Yu Lei Linbin Yu Raghu N. Kacker D. Richard Kuhn

Published in: ICST Workshops (2015)

Keyphrases

graph coloring
combinatorial problems
job shop scheduling
np complete problems
phase transition
scheduling problem
hamiltonian cycle
max sat
hyper heuristics
constraint satisfaction problems
computational complexity
orders of magnitude
constraint satisfaction