Computational Approaches to Max-Cut

Laura Palagi (), Veronica Piccialli (), Franz Rendl (), Giovanni Rinaldi () and Angelika Wiegele ()
Additional contact information
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

Chapter Chapter 28 in Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, pp 821-847 from Springer

Abstract: 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.

Keywords: Semidefinite Program; Exact Penalty; Global Optimality Condition; Weighted Adjacency Matrix; Dual Objective Function (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (4)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-0769-0_28

Ordering information: This item can be ordered from
http://www.springer.com/9781461407690

DOI: 10.1007/978-1-4614-0769-0_28

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().