ricca200xx / Find-a-maximal-clique-with-optimization-algorithm Public

Notifications You must be signed in to change notification settings
Fork 1
Star 3

This project solves the Maximum Clique Problem using continuous optimization algorithms like Projected Gradient Descent and Frank-Wolfe, implemented in a Jupyter Notebook.

3 stars 1 fork Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 38 Commits
data		data
.DS_Store		.DS_Store
.gitattributes		.gitattributes
.gitignore		.gitignore
README.md		README.md
README.txt		README.txt
final_project.ipynb		final_project.ipynb
requirements.txt		requirements.txt
results.csv		results.csv

Repository files navigation

OPTIMIZATION_PROJECT

About

This project solves the Maximum Clique Problem using continuous optimization algorithms like Projected Gradient Descent and Frank-Wolfe, implemented in a Jupyter Notebook.