Heuristics for Improving the Non-oblivious Local Search for MaxSAT.
Guillermo De ItaDavid Eduardo PintoM. NuñoPublished in: IBERAMIA (1998)
Keyphrases
- search algorithm
- combinatorial optimization
- simulated annealing and tabu search
- heuristic search
- search strategies
- search procedures
- upper bound
- genetic algorithm
- propositional satisfiability
- branch and bound algorithm
- heuristic methods
- data sets
- stochastic local search
- search heuristics
- tree search
- search space
- sat solvers
- database
- branch and bound
- optimal solution
- job shop scheduling problem
- sat problem
- beam search
- lower bound
- tabu search
- domain independent planning
- metaheuristic