h-escoffier / Anneal-ize_the_Vertex

An efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem

AtV : Anneal-ize the Vertex

Simulated Annealing applied to the Minimum Vertex Cover Problem

by Hugues Esc_ & OGrondin

Introduction

Anneal-ize the Vertex is a version of an efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem.

Installation

To run this program, run the following commands in a terminal prompt:

git clone https://github.com/h-escoffier/Anneal-ize_the_Vertex
cd Anneal-ize_the_Vertex
pip install -r requirements.txt 

Running AtV

Running AtV under its basic parameters:

./run.py 

References

Xinshun Xu, Jun Ma, An efficient simulated annealing algorithm for the minimum vertex cover problem, Neurocomputing, Volume 69, Issues 7–9, 2006, Pages 913-916, ISSN 0925-2312, https://doi.org/10.1016/j.neucom.2005.12.016.