@article {36248,
	title = {A simple iterative algorithm for maxcut},
	journal = {Journal of Computational Mathematics},
	volume = {42},
	year = {2024},
	pages = {1277-1304},
	abstract = {We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages that all subproblems have explicit analytic solutions, the cut values are monotonically up- dated and the iteration points converge to a local optima in finite steps via an appropriate subgradient selection. Numerical experiments on G-set demonstrate the performance. In particular, the ratios between the best cut values achieved by SI and those by some ad- vanced combinatorial algorithms in [Ann. Oper. Res., 248 (2017), 365{\textendash}403] are at least 0.986 and can be further improved to at least 0.997 by a preliminary attempt to break out of local optima.},
	url = {https://www.global-sci.org/intro/article_detail/jcm/23278.html},
	author = {Sihong Shao and Dong Zhang and Weixi Zhang}
}
