All algorithms were implemented in Python.
Libraries: dimacs.py, pycoSAT, PuLP.
Exact algorithms for Vertex Cover (brute force, O(2k), O(1.618k), O(1.47k) algorithms).
Approximation algorithms for Vertex cover (2-approximation, O(logn) algorithm).
1 - Experiment for satisfiability probability of SAT-3CNF random problems.
2a - Graph Coloring reduction to SAT.
1 - Example ILP problem solution.
2 - Vertex Cover reduction to ILP.