Tabu search and a quadratic relaxation for the Satisfiability problem.
Brigitte JaumardMihnea StanJacques DesrosiersPublished in: Cliques, Coloring, and Satisfiability (1993)
Keyphrases
- tabu search
- satisfiability problem
- search algorithm
- objective function
- metaheuristic
- max sat
- simulated annealing
- np complete
- temporal logic
- feasible solution
- path relinking
- scheduling problem
- phase transition
- memetic algorithm
- sat problem
- vehicle routing problem
- sat instances
- hybrid algorithm
- heuristic methods
- search procedure
- job shop scheduling problem
- computational complexity
- stochastic local search algorithms
- heuristic search
- benchmark instances
- tabu list
- lagrangian relaxation
- quadratic assignment problem
- genetic algorithm
- search strategy
- multi start
- variable neighborhood search
- search space
- initial solution
- iterated local search
- scatter search
- evolutionary algorithm
- optimization problems
- ant colony optimization
- model checking
- search methods
- lp relaxation
- orders of magnitude
- multidimensional knapsack problem
- knowledge base