Gary A. Kochenberger, Jin-Kao Hao, Zhipeng Lü, Haibo Wang and Fred Glover
Journal of Heuristics, Volume 19, Issue 4, August 2013, pp 565-571

In recent years many algorithms have been proposed in the literature for solving the Max-Cut problem. In this paper we report on the application of a new Tabu Search algorithm to large scale Max-cut test problems. Our method provides best known solutions for many well-known test problems of size up to 10,000 variables, although it is designed for the general unconstrained quadratic binary program (UBQP), and is not specialized in any way for the Max-Cut problem.