A gradient-based randomised heuristic for the maximum cut problem
Summary: We present a randomised heuristic for the maximum cut problem. It consists in finding an approximate solution of a formulation of the maximum cut problem as an unconstrained non-convex optimisation problem. Computational studies are reported. They indicate that the proposed method is competitive with the best known procedures present in the literature.
scientific article; zbMATH DE number 6108304