math.OC

(what is this?)

# Title: A simple algorithm for Max Cut

Abstract: Based on an explicit equivalent continuous optimization problem, we propose a simple continuous iterative algorithm for Max Cut, which converges to a local optimum in finite steps. The inner subproblem is solved analytically and thus no optimization solver is called. Preliminary results on G-set demonstrate the performance. In particular, the ratio between the best cut values achieved by the simple algorithm without any local breakout techniques and the best known ones is of at least $0.986$.
 Comments: Submitted to Conference on March 17, 2018 Subjects: Optimization and Control (math.OC); Combinatorics (math.CO); Numerical Analysis (math.NA) Cite as: arXiv:1803.06496 [math.OC] (or arXiv:1803.06496v1 [math.OC] for this version)

## Submission history

From: Sihong Shao [view email]
[v1] Sat, 17 Mar 2018 12:29:19 GMT (15kb)