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

Standard

New facets of the clique partitioning polytope. / Letchford, Adam; Soerensen, Michael.
In: Operations Research Letters, Vol. 59, 107242, 06.03.2025.

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

Harvard

Letchford, A & Soerensen, M 2025, 'New facets of the clique partitioning polytope', Operations Research Letters, vol. 59, 107242. https://doi.org/10.1016/j.orl.2025.107242

APA

Letchford, A., & Soerensen, M. (2025). New facets of the clique partitioning polytope. Operations Research Letters, 59, Article 107242. https://doi.org/10.1016/j.orl.2025.107242

Vancouver

Letchford A, Soerensen M. New facets of the clique partitioning polytope. Operations Research Letters. 2025 Mar 6;59:107242. Epub 2025 Jan 17. doi: 10.1016/j.orl.2025.107242

Author

Letchford, Adam ; Soerensen, Michael. / New facets of the clique partitioning polytope. In: Operations Research Letters. 2025 ; Vol. 59.

Bibtex

@article{27b3dce7f096415aba09f202bf9f9a67,
title = "New facets of the clique partitioning polytope",
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.",
keywords = "combinatorial optimisation",
author = "Adam Letchford and Michael Soerensen",
year = "2025",
month = mar,
day = "6",
doi = "10.1016/j.orl.2025.107242",
language = "English",
volume = "59",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - New facets of the clique partitioning polytope

AU - Letchford, Adam

AU - Soerensen, Michael

PY - 2025/3/6

Y1 - 2025/3/6

N2 - 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.

AB - 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.

KW - combinatorial optimisation

U2 - 10.1016/j.orl.2025.107242

DO - 10.1016/j.orl.2025.107242

M3 - Journal article

VL - 59

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

M1 - 107242

ER -