Solving large scale Max Cut problems via tabu search.
Gary A. KochenbergerJin-Kao HaoZhipeng LüHaibo WangFred W. GloverPublished in: J. Heuristics (2013)
Keyphrases
- tabu search
- search heuristics
- test problems
- search algorithm for solving
- metaheuristic
- np complete problems
- simulated annealing
- max cut
- search algorithm
- heuristic methods
- graph coloring
- optimization problems
- max sat
- combinatorial optimization
- genetic algorithm
- tabu search algorithm
- feasible solution
- benchmark problems
- np complete
- scheduling problem
- search procedure
- decision problems
- job shop scheduling problem
- difficult problems
- combinatorial problems
- memetic algorithm
- hard problems
- evolutionary algorithm
- vehicle routing problem
- branch and bound algorithm
- minimum cost
- search space
- phase transition