New facets of the clique partitioning polytope

Letchford, Adam and Soerensen, Michael (2025) New facets of the clique partitioning polytope. Operations Research Letters, 59: 107242. ISSN 0167-6377

Text (ORL-D-24-285-R1)
ORL-D-24-285-R1.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (296kB)

Abstract

The clique partitioning problem is a combinatorial optimisation problem which has many applications. At present, the most promising exact algorithms are those that are based on an understanding of the associated polytope. We present two new families of valid inequalities for that polytope, and show that the inequalities define facets under certain conditions.