A simple iterative algorithm for maxcut

DOI10.4208/JCM.2303-M2021-0309MaRDI QIDQ7019824zbMATH OpenFDO

Authors Sihong Shao, Dong Zhang, Weixi Zhang

Publication date 5 March 2025

Published in Journal of Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

iterative algorithmexact solutionfractional programmingmaxcutsubgradient selection

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Fractional programming (90C32) Graph algorithms (graph-theoretic aspects) (05C85) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Cites work

• A max-cut approach to heterogeneity in cryo-electron microscopy
• A multiple search operator heuristic for the max-k-cut problem
• Advanced scatter search for the max-cut problem
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Fractional programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Laplacian eigenvalues and the maximum cut problem
• Max cut and the smallest eigenvalue
• Nodal domains of eigenvectors for 1-Laplacian on graphs
• On Nonlinear Fractional Programming
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Reducibility among combinatorial problems
• Solving the max-cut problem using eigenvalues

Cited in

(2)

• An ODE approach to multiple choice polynomial programming
• Dual Cheeger constants, signless 1-Laplacians and maxcut

This page was built for publication: A simple iterative algorithm for maxcut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019824)