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

@article{Ling2011AND,
  title={A new discrete filled function method for solving large scale max-cut problems},
  author={Ai-fan Ling and Cheng-Xian Xu},
  journal={Numerical Algorithms},
  year={2011},
  volume={60},
  pages={435-461}
}
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… CONTINUE READING