Back to Search
Start Over
A novel formulation of the max-cut problem and related algorithm.
- Source :
-
Applied Mathematics & Computation . Apr2020, Vol. 371, pN.PAG-N.PAG. 1p. - Publication Year :
- 2020
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SEMIDEFINITE programming
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 371
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 140984268
- Full Text :
- https://doi.org/10.1016/j.amc.2019.124970