IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-0769-0_28.html
   My bibliography  Save this book chapter

Computational Approaches to Max-Cut

In: Handbook on Semidefinite, Conic and Polynomial Optimization

Author

Listed:
  • Laura Palagi

    (Università degli Studi di Roma “La Sapienza”)

  • Veronica Piccialli

    (Università degli Studi di Roma Tor Vergata)

  • Franz Rendl

    (Alpen-Adria-Universität Klagenfurt)

  • Giovanni Rinaldi

    (Istituto di Analisi dei Sistemi ed Informatica “A. Ruberti”)

  • Angelika Wiegele

    (Alpen-Adria-Universität Klagenfurt)

Abstract

Max-Cut is one of the most studied combinatorial optimization problems because of its wide range of applications and because of its connections with other fields of discrete mathematics (see, e.g., the book by Deza and Laurent [10]). Like other interesting combinatorial optimization problems, Max-Cut is very simple to state.

Suggested Citation

  • Laura Palagi & Veronica Piccialli & Franz Rendl & Giovanni Rinaldi & Angelika Wiegele, 2012. "Computational Approaches to Max-Cut," International Series in Operations Research & Management Science, in: Miguel F. Anjos & Jean B. Lasserre (ed.), Handbook on Semidefinite, Conic and Polynomial Optimization, chapter 0, pages 821-847, Springer.
    • Handle: RePEc:spr:isochp:978-1-4614-0769-0_28
    DOI: 10.1007/978-1-4614-0769-0_28
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Weber, Shlomo & Castaneda Dower, Paul & Gokmen, Gunes & Le Breton, Michel, 2021. "Did the Cold War Produce Development Clusters in Africa?," CEPR Discussion Papers 15810, C.E.P.R. Discussion Papers.
    2. Christoph Buchheim & Emiliano Traversi, 2018. "Quadratic Combinatorial Optimization Using Separable Underestimators," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 424-437, August.
    3. Timotej Hrga & Janez Povh, 2021. "MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM," Computational Optimization and Applications, Springer, vol. 80(2), pages 347-375, November.
    4. Christoph Buchheim & Marianna De Santis & Laura Palagi & Mauro Piacentini, 2012. "An Exact Algorithm for Quadratic Integer Minimization using Nonconvex Relaxations," DIS Technical Reports 2012-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-1-4614-0769-0_28. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.