Implementation of branch and bound algorithm for maximum clique problem with cplex
-
Updated
Dec 23, 2017 - Python
Implementation of branch and bound algorithm for maximum clique problem with cplex
The final project in the course "Automated reasoning about software" 67532 (The Hebrew University of Jerusalem).
Add a description, image, and links to the lp-problem topic page so that developers can more easily learn about it.
To associate your repository with the lp-problem topic, visit your repo's landing page and select "manage topics."