Download Heuristic Algorithms for NP

Summary
I have implemented a small framework of NP-complete problems in Java, where
it is possible to transform instances of one NP-Complete problem into instance
of another NP-Complete problem. The framework also consists of a few heuristic
algorithms, which makes it possible to find a heuristic solution for instances of
an NP-Complete problem.
Combining these two features it is possible to transform an instance of one NPComplete problem into another instance. This transformed instance may then
be solved by the available heuristic algorithm and the found heuristic solution
may then be detransformed to the original instance. Last but not least it is
possible to view this scheme through a nice user friendly GUI.
This report analyzes the design of the framework, the behavior of the heuristic
algorithms to transformed instances and how one may find the best transformation automatically to a given NP-Complete problem.