There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
This paper evaluates the performance of four distinct algorithms in solving the Minimum Vertex Cover problem: Branch and Bound method algorithm, an approximate heuristic algorithm (Greedy Independent Cover) and two local search algorithms (Hill-Climbing and Simulated Annealing)
