Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search.
David ChalupaPublished in: EvoCOP (2013)
Keyphrases
- tabu search
- random graphs
- simulated annealing
- metaheuristic
- path relinking
- search heuristics
- scheduling problem
- memetic algorithm
- graph theoretic
- hybrid algorithm
- search algorithm for solving
- iterated local search
- feasible solution
- combinatorial optimization
- vehicle routing problem
- search procedure
- search algorithm
- job shop scheduling problem
- tabu search algorithm
- scatter search
- quadratic assignment problem
- phase transition
- initial solution
- genetic algorithm
- heuristic methods
- benchmark instances
- tabu list
- max sat
- evolutionary algorithm
- timetabling problem
- candidate list
- variable neighborhood search
- multi start
- neural network
- cellular automata
- power law
- np hard
- optimization problems
- solution quality
- linear programming
- tree structure