Login / Signup
Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles.
Miroslav N. Velev
Ping Gao
Published in:
SARA (2009)
Keyphrases
</>
graph coloring
decision problems
solving problems
sat encodings
sat solvers
neural network
optimization problems
computationally efficient
search methods
benchmark problems
stochastic local search
stochastic local search algorithms
satisfiability testing
provide efficient solutions