Home > Research > Publications & Outputs > A note on the 2-circulant inequalities for the ...

Associated organisational unit

Electronic data

  • circulant

    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, 46, 4, 2018 DOI: 10.1016/j.orl.2018.05.006

    Accepted author manuscript, 276 KB, PDF-document

    Embargo ends: 30/11/19

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

Links

Text available via DOI:

View graph of relations

A note on the 2-circulant inequalities for the max-cut problem

Research output: Contribution to journalJournal article

Published
<mark>Journal publication date</mark>07/2018
<mark>Journal</mark>Operations Research Letters
Issue number4
Volume46
Number of pages5
Pages (from-to)443-447
<mark>State</mark>Published
Early online date30/05/18
<mark>Original language</mark>English

Abstract

The max-cut problem is a much-studied NP-hard combinatorial optimisation problem. Poljak and Turzik found some facet-defining inequalities for this problem, which we call 2-circulant inequalities. Two polynomial-time separation algorithms have been found for these inequalities, but one is very slow and the other is very complicated. We present a third algorithm, which is as fast as the faster of the existing two, but much simpler.

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, 46, 4, 2018 DOI: 10.1016/j.orl.2018.05.006