New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.
Paola AlimontiPublished in: CIAC (1994)
Keyphrases
- satisfiability problem
- search algorithm
- stochastic local search
- search procedures
- np complete
- phase transition
- temporal logic
- sat problem
- graph coloring problems
- solving hard
- stochastic local search algorithms
- max sat
- search space
- combinatorial optimization
- pspace complete
- sat instances
- mazurkiewicz traces
- tree search
- search strategies
- branch and bound
- scheduling problem
- genetic algorithm
- propositional satisfiability
- search methods
- davis putnam
- tabu search
- simulated annealing