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

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, 277 KB, PDF document

    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 Journal/MagazineJournal articlepeer-review

Published

Standard

A note on the 2-circulant inequalities for the max-cut problem. / Kaparis, Konstantinos; Letchford, Adam Nicholas.

In: Operations Research Letters, Vol. 46, No. 4, 07.2018, p. 443-447.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Kaparis K, Letchford AN. A note on the 2-circulant inequalities for the max-cut problem. Operations Research Letters. 2018 Jul;46(4):443-447. Epub 2018 May 30. doi: 10.1016/j.orl.2018.05.006

Author

Kaparis, Konstantinos ; Letchford, Adam Nicholas. / A note on the 2-circulant inequalities for the max-cut problem. In: Operations Research Letters. 2018 ; Vol. 46, No. 4. pp. 443-447.

Bibtex

@article{298fe14cb2b44884a467062106e45c95,
title = "A note on the 2-circulant inequalities for the max-cut problem",
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.",
keywords = "max-cut problem, polyhedral combinatorics, branch-and-cut",
author = "Konstantinos Kaparis and Letchford, {Adam Nicholas}",
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, 46, 4, 2018 DOI: 10.1016/j.orl.2018.05.006",
year = "2018",
month = jul,
doi = "10.1016/j.orl.2018.05.006",
language = "English",
volume = "46",
pages = "443--447",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "4",

}

RIS

TY - JOUR

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

AU - Kaparis, Konstantinos

AU - Letchford, Adam Nicholas

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

PY - 2018/7

Y1 - 2018/7

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

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

KW - max-cut problem

KW - polyhedral combinatorics

KW - branch-and-cut

U2 - 10.1016/j.orl.2018.05.006

DO - 10.1016/j.orl.2018.05.006

M3 - Journal article

VL - 46

SP - 443

EP - 447

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -