Skip to content

An upper bound algorithm implementation for the Maximum Clique problem, through Integer Programming Column Generation.

Notifications You must be signed in to change notification settings

sk-surya/relax-cliques

Repository files navigation

relax-cliques

An upper bound algorithm implementation for the Maximum Clique problem, through Column Generation using C++, CPLEX and AMPL. Graph data from DIMACS 2nd Implementation Challenge

Read the pdf for a detailed description.

A simpler, easy to understand implementation is in the Jupyter Notebook.

About

An upper bound algorithm implementation for the Maximum Clique problem, through Integer Programming Column Generation.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published