A novel formulation of the max-cut problem and related algorithm

Qingzhi Yang,Yiyong Li,Pengfei Huang

doi:10.1016/j.amc.2019.124970

A novel formulation of the max-cut problem and related algorithm

Qingzhi Yang, Yiyong Li + Show 1 more

https://doi.org/10.1016/j.amc.2019.124970

Copy DOI

Journal: Applied Mathematics and Computation

Publication Date: Dec 24, 2019

Affiliation: Nankai University

#Semidefinite Programming #Formulation Of Problem + Show 4 more

Abstract
Full-Text PDF
Similar Papers

Abstract

In this paper, a new formulation of the max-cut problem is proposed. Several semidefinite programming(SDP) relaxations of the max-cut problem are given and some relationships between them are put forward. Based on a new SDP relaxation, an algorithm is presented for finding a better approximate solution of the max-cut problem and we show the advantages of our model and algorithm with several examples.

Full Text