-
-
Vertex_Cover_Code.zip
... best algorithm for this problem is known to run at O(1.2852k + kn). The optimal solution is intractable, thus optimization strategies in solving the vertex cover problem are brought off-the-shelves, including pre-processing, kernelization, and branching ...
-
-
-
-
steepest_method_with_const_step.rar
NUMERICAL OPTIMIZATION:
This is steepest descent method with constant step length to find the minima of
f(x, y) = xy exp(− 2x^2 − y^2 + 0.3y)
Graphical represxentation in 5 ways of solution, simple and clear explained.
-
-
-
-
-
-