The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness

An hybrid simulated annealing threshold accepting algorithm for satisfiability problems using dynamically cooling schemes

WSEAS Transactions on Computers

Golden ratio annealing for satisfiability problems using dynamically cooling schemes

ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems

A hybrid simulated annealing and threshold accepting for for satisfiability problems using dynamically cooling schemes

CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics

Solving SAT problems with TA algorithms using constant and dynamic markov chains length

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management