A new discrete filled function method for solving large scale max-cut problems

Authors:
Ai-Fan Ling;Cheng-Xian Xu
Affiliations:
School of Finance, Jiangxi University of Finance & Economics, Nanchang, People's Republic of China 330013 and Academy of Mathematics & Systems Science, Chinese Academy of Sciences, Beijing, People ...;Hangzhou Institute of Service Engineering, Hangzhou Normal University, Hangzhou, People's Republic of China 310036
Venue:
Numerical Algorithms
Year:
2012

Citing 16
Cited 0

An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
A continuous approach to nonlinear integer programming

Applied Mathematics and Computation
A filled function method for finding a global minimizer of a function of several variables

Mathematical Programming: Series A and B
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
An approximate algorithm for nonlinear integer programming

Applied Mathematics and Computation
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
A Spectral Bundle Method for Semidefinite Programming

SIAM Journal on Optimization
Finding Global Minima with a Computable Filled Function

Journal of Global Optimization
Filled functions for unconstrained global optimization

Journal of Global Optimization
A New Filled Function Method for Global Optimization

Journal of Global Optimization
Discrete Filled Function Method for Discrete Global Optimization

Computational Optimization and Applications
A low-level hybridization between memetic algorithm and VNS for the max-cut problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Lagrangian Smoothing Heuristics for Max-Cut

Journal of Heuristics
A filled function method for finding a global minimizer on global integer optimization

Journal of Computational and Applied Mathematics
A new class of filled functions for global minimization

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The global optimization method based on discrete filled function is a new method that solves large scale max-cut problems. We first define a new discrete filled function based on the structure of the max-cut problem and analyze its properties. Unlike the continuous filled function methods, by the characteristic of the max-cut problem, the parameters in the proposed filled function does not need to be adjusted. By combining a procedure that randomly generates initial points for minimization of the proposed filled function, the proposed algorithm can greatly reduce the computational time and be applied to large scale max-cut problems. Numerical results and comparisons with several heuristic methods indicate that the proposed algorithm is efficient and stable to obtain high quality solution of large scale max-cut problems.