Home > Research > Publications & Outputs > Generalised 2-circulant inequalities for the ma...

Research

Associated organisational unit

Electronic data

  • max-cut-circulants2

    Rights statement: This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, 50, 2, 2022 DOI: 10.1016/j.orl.2022.01.005

    Accepted author manuscript, 320 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

Generalised 2-circulant inequalities for the max-cut problem

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

Published

Standard

Generalised 2-circulant inequalities for the max-cut problem. / Kaparis, Konstantinos; Letchford, Adam; Mourtos, Ioannis .
In: Operations Research Letters, Vol. 50, No. 2, 31.03.2022, p. 122-128.

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

Harvard

Kaparis, K, Letchford, A & Mourtos, I 2022, 'Generalised 2-circulant inequalities for the max-cut problem', Operations Research Letters, vol. 50, no. 2, pp. 122-128. https://doi.org/10.1016/j.orl.2022.01.005

APA

Kaparis, K., Letchford, A., & Mourtos, I. (2022). Generalised 2-circulant inequalities for the max-cut problem. Operations Research Letters, 50(2), 122-128. https://doi.org/10.1016/j.orl.2022.01.005

Vancouver

Kaparis K, Letchford A, Mourtos I. Generalised 2-circulant inequalities for the max-cut problem. Operations Research Letters. 2022 Mar 31;50(2):122-128. Epub 2022 Jan 20. doi: 10.1016/j.orl.2022.01.005

Author

Kaparis, Konstantinos ; Letchford, Adam ; Mourtos, Ioannis . / Generalised 2-circulant inequalities for the max-cut problem. In: Operations Research Letters. 2022 ; Vol. 50, No. 2. pp. 122-128.

Bibtex

@article{477009fb67514455a1b029a7df3df54f,
title = "Generalised 2-circulant inequalities for the max-cut problem",
abstract = "The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results.",
keywords = "max-cut problem, polyhedral combinatorics, combinatorial optimisation",
author = "Konstantinos Kaparis and Adam Letchford and Ioannis Mourtos",
note = "This is the author{\textquoteright}s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, vol. 50, issue 2, pp. 122-128, 2022 DOI: 10.1016/j.orl.2022.01.005",
year = "2022",
month = mar,
day = "31",
doi = "10.1016/j.orl.2022.01.005",
language = "English",
volume = "50",
pages = "122--128",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "2",

}

RIS

TY - JOUR

T1 - Generalised 2-circulant inequalities for the max-cut problem

AU - Kaparis, Konstantinos

AU - Letchford, Adam

AU - Mourtos, Ioannis

N1 - This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, vol. 50, issue 2, pp. 122-128, 2022 DOI: 10.1016/j.orl.2022.01.005

PY - 2022/3/31

Y1 - 2022/3/31

N2 - The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results.

AB - The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results.

KW - max-cut problem

KW - polyhedral combinatorics

KW - combinatorial optimisation

U2 - 10.1016/j.orl.2022.01.005

DO - 10.1016/j.orl.2022.01.005

M3 - Journal article

VL - 50

SP - 122

EP - 128

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 2

ER -