Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
Monaldo MastrolilliLuca Maria GambardellaPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- tabu search
- max sat
- maximum satisfiability
- worst case
- guided local search
- metaheuristic
- simulated annealing
- lower bound
- combinatorial problems
- path relinking
- scheduling problem
- upper bound
- search algorithm
- boolean satisfiability
- feasible solution
- exact algorithms
- memetic algorithm
- graph coloring
- vehicle routing problem
- job shop scheduling problem
- genetic algorithm
- heuristic methods
- approximation algorithms
- search procedure
- phase transition
- np hard
- space complexity
- hill climbing
- branch and bound algorithm
- stochastic local search
- branch and bound
- particle swarm optimization
- optimization problems
- multi objective
- computational complexity
- optimal solution
- tabu search algorithm
- ant colony optimization