Home > Research > Browse

Results for max-cut problem

Publications & Outputs

  1. Generalised 2-circulant inequalities for the max-cut problem

    Kaparis, K., Letchford, A. & Mourtos, I., 31/03/2022, In: Operations Research Letters. 50, 2, p. 122-128 7 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

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

    Kaparis, K. & Letchford, A. N., 07/2018, In: Operations Research Letters. 46, 4, p. 443-447 5 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  3. A new separation algorithm for the Boolean quadric and cut polytopes

    Letchford, A. & Sorensen, M. M., 2/08/2014, In: Discrete Optimization. 14, p. 61-71 11 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  4. Complexity results for the gap inequalities for the max-cut problem

    Galli, L., Kaparis, K. & Letchford, A. N., 05/2012, In: Operations Research Letters. 40, 3, p. 149-152 4 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  5. Gap inequalities for the max-cut problem: a cutting-plane algorithm

    Galli, L., Kaparis, K. & Letchford, A., 2012, Combinatorial Optimization: Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers. Mahjoub, A. R. (ed.). Berlin: Springer, p. 178-188 11 p. (Lecture Notes in Computer Science; vol. 7422).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter (peer-reviewed)peer-review

  6. Gap inequalities for non-convex mixed-integer quadratic programs

    Galli, L., Kaparis, K. & Letchford, A. N., 2011, In: Operations Research Letters. 39, 5, p. 297-300 4 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  7. Small bipartite subgraph polytopes

    Galli, L. & Letchford, A. N., 2010, In: Operations Research Letters. 38, 5, p. 337-340 4 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  8. Exploring the relationship between max-cut and stable set relaxations

    Giandomenico, M. & Letchford, A. N., 03/2006, In: Mathematical Programming. 106, 1, p. 159-175 17 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review