A novel formulation of the max-cut problem and related algorithm
From MaRDI portal
Publication:2287710
DOI10.1016/j.amc.2019.124970zbMath1433.90106OpenAlexW2997799421WikidataQ126524003 ScholiaQ126524003MaRDI QIDQ2287710
Yi-Yong Li, Pengfei Huang, Qingzhi Yang
Publication date: 21 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124970
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Semidefinite programming in combinatorial optimization
- Quadratic maximization and semidefinite relaxation
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- On the optimality of the random hyperplane rounding technique for MAX CUT
- An Interior-Point Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Reducibility among Combinatorial Problems
- Semidefinite programming and combinatorial optimization
This page was built for publication: A novel formulation of the max-cut problem and related algorithm
