A semidefinite programming-based heuristic for graph coloring.
Igor DukanovicFranz RendlPublished in: Discret. Appl. Math. (2008)
Keyphrases
- semidefinite programming
- graph coloring
- hyper heuristics
- combinatorial problems
- linear programming
- job shop scheduling
- constraint satisfaction problems
- combinatorial optimization
- kernel matrix
- max sat
- constraint satisfaction
- phase transition
- genetic programming
- timetabling problem
- bin packing
- scheduling problem
- difficult problems
- primal dual
- evolutionary algorithm
- heuristic methods
- metaheuristic
- constraint programming
- simulated annealing
- optimal solution
- tabu search
- search strategies
- traveling salesman problem
- job shop scheduling problem
- search procedure
- neural network
- search algorithm
- heuristic search
- search heuristics
- dynamic programming
- multi objective
- learning algorithm