A Tight Semidefinite Relaxation of the MAX CUT Problem

Hongwei Liu (), Sanyang Liu and Fengmin Xu
Additional contact information
Hongwei Liu: Xidian University
Sanyang Liu: Xidian University
Fengmin Xu: Xi'an Jiaotong University

Journal of Combinatorial Optimization, 2003, vol. 7, issue 3, No 3, 237-245

Abstract: Abstract We obtain a tight semidefinite relaxation of the MAX CUT problem which improves several previous SDP relaxation in the literature. Not only is it a strict improvement over the SDP relaxation obtained by adding all the triangle inequalities to the well-known SDP relaxation, but also it satisfy Slater constraint qualification (strict feasibility).

Keywords: MAX CUT problem; semidefinite relaxation; cut polytope; metric polytope (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1027364420370 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v:7:y:2003:i:3:d:10.1023_a:1027364420370

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1027364420370

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().