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
<mark>Journal publication date</mark>31/03/2022
<mark>Journal</mark>Operations Research Letters
Issue number2
Volume50
Number of pages7
Pages (from-to)122-128
Publication StatusPublished
Early online date20/01/22
<mark>Original language</mark>English

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.

Bibliographic note

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