A class of transitivity constraints in the clique partitioning ILP are redundant and removable while preserving optimal solutions, yielding a smaller formulation that outperforms prior ones on correlation clustering with {-1,1} edge weights.
Optimal correlation clustering via maxsat, in: 2013 IEEE 13th international conference on data mining workshops, IEEE
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the redundancy of transitivity constraints in the clique partitioning problem
A class of transitivity constraints in the clique partitioning ILP are redundant and removable while preserving optimal solutions, yielding a smaller formulation that outperforms prior ones on correlation clustering with {-1,1} edge weights.