A discrete dynamic convexized method for
โ
Wenxing Zhu; Hong Fan
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 820 KB
In this paper, we consider the box constrained nonlinear integer programming problem. We present an auxiliary function, which has the same discrete global minimizers as the problem. The minimization of the function using a discrete local search method can escape successfully from previously converge