Conservative Graph Coloring: A Robust Method for Automatic PCI Assignment in LTE.

Lukasz Chrost Krzysztof Grochla

Published in: CN (2013)

Keyphrases

graph coloring
job shop scheduling
combinatorial problems
np complete problems
phase transition
max sat
constraint satisfaction problems
scheduling problem
neural network
dynamic programming
lower bound
multi objective
metaheuristic
heuristic search
hyper heuristics