Solving large scale Max Cut problems via tabu search

Authors:
Gary A. Kochenberger;Jin-Kao Hao;Zhipeng Lü;Haibo Wang;Fred Glover
Affiliations:
University of Colorado, Denver, USA;LERIA, Universite d'Angers, Angers Cedex 01, France 49045;LERIA, Universite d'Angers, Angers Cedex 01, France 49045;Texas A&M International University, Laredo, USA;OptTek Systems, Boulder, USA 80302
Venue:
Journal of Heuristics
Year:
2013

Citing 6
Cited 0

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
Solving Graph Bisection Problems with Semidefinite Programming

INFORMS Journal on Computing
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem

Computational Optimization and Applications
Advanced Scatter Search for the Max-Cut Problem

INFORMS Journal on Computing
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.