A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem.
Zoran OgnjanovicUros MidicNenad MladenovicPublished in: Hybrid Metaheuristics (2005)
Keyphrases
- hybrid genetic
- sat problem
- satisfiability problem
- max sat
- sat solvers
- variable neighborhood descent
- np complete
- constraint satisfaction problems
- random sat instances
- phase transition
- randomly generated
- support vector regression
- modeling method
- multi start
- special case
- search space
- path relinking
- decision problems
- heuristic search
- linear programming
- iterated local search
- learning algorithm
- machine learning
- neural network