Dual decomposition solvers for (lifted) multicut and max cut based on the LP_MP library.
-
Updated
Aug 3, 2018 - C++
Dual decomposition solvers for (lifted) multicut and max cut based on the LP_MP library.
Branch and cut algorithm for the clique partitioning problem
This repo contains various exact and approximation algorithm for graph correlation clustering problems.
Add a description, image, and links to the correlation-clustering topic page so that developers can more easily learn about it.
To associate your repository with the correlation-clustering topic, visit your repo's landing page and select "manage topics."