solving Random 3-SAT(Boolean satisfiability problem) using simulated annealing.
Bachelor's thesis: Solving the 3-SAT problem using quantum algorithms
A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem
C++ 3-SAT Simulated Annealing Solver
Contains the assignment 1,2,3 and 4
Hybrid heuristic and exact solvers for 0-1 Knapsack (GA+B&B, 90%), 3-SAT (WalkSAT+GSAT, 100%), and TSP (GA+2-opt/3-opt, 76% exact). Research-grade benchmarking on Pisinger, SATLIB UF250, and TSPLIB.
Java implementation of a total unimodularity based branch and bound method for boolean integer programming
Investigate phase transitions in k-SAT problems
C++17 implementation of Survey Propagation (SP) and Survey Inspired Decimation (SID) for 3-SAT, with random and community-attachment generators. Experiments for the master's thesis 'Survey Propagation in real-world SAT instances'.
Add a description, image, and links to the 3-sat topic page so that developers can more easily learn about it.
To associate your repository with the 3-sat topic, visit your repo's landing page and select "manage topics."