A GRASP/VND Heuristic for the Max Cut-Clique Problem.
Mathias BourelEduardo A. CanaleFranco RobledoPablo RomeroLuis StábilePublished in: LOD (2018)
Keyphrases
- max cut
- tabu search
- multi start
- graph model
- np hard
- simulated annealing
- graph partitioning
- optimal solution
- np complete problems
- planar graphs
- heuristic methods
- greedy heuristic
- evolutionary algorithm
- spectral graph
- feasible solution
- combinatorial optimization
- constraint satisfaction
- path relinking
- metaheuristic
- data clustering
- search procedure
- mixed integer programming
- graphical models
- objective function