Home > Research > Publications & Outputs > New facets of the clique partitioning polytope

Research

Associated organisational unit

Electronic data

  • ORL-D-24-285-R1

    Accepted author manuscript, 290 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

New facets of the clique partitioning polytope

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published
Article number107242
<mark>Journal publication date</mark>6/03/2025
<mark>Journal</mark>Operations Research Letters
Volume59
Number of pages4
Publication StatusPublished
Early online date17/01/25
<mark>Original language</mark>English

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.