Solving large scale Max Cut problems via tabu search
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.
KeywordsMax Cut problem Metaheuristics Combinatorial optimization
Unable to display preview. Download preview PDF.
- Choi, C., Ye, Y.: Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. Working Paper, Department of Management Sciences, The University of Iowa (2000) Google Scholar
- Helmberg, C., Rendl, F.: Solving quadratic (0-1) problems by semidefinite programs and cutting planes. Working Paper, Technische Universitat Graz (1996) Google Scholar
- Karish, S., Rendl, F., Clausen, J.: Solving graph bisection problems with semidefinite programming. SIAM J. Comput. 12, 177–191 (2000) Google Scholar
- Poljak, S., Tuza, Z.: The Max-Cut problem: a survey. In: Cook, W., Lovasz, L., Seymour, P. (eds.) Special Year on Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Computer Science. Am. Math. Soc., Providence (1995) Google Scholar