A Branch-and-Cut algorithm for graph coloring.

Isabel Méndez-Díaz Paula Zabala

Published in: Discret. Appl. Math. (2006)

Keyphrases

graph coloring
learning algorithm
dynamic programming
hamiltonian cycle
computational complexity
cost function
np hard
optimization algorithm
optimal solution
graph model
bin packing
simulated annealing
linear programming
benchmark problems
space complexity