| [1] Ge R P. A filled function method function for finding a global minimizer of a function of several variables[J]. Math. Program, 1990, 46: 91-204.[2] Ge R P, Huang H. A continous approach to nonlinear integer programming[J]. Appl. Math. Comput., 1989, 34: 39-60.[3] Tuy H, Horst R. Convergence and restart in branch-and-bound algorithm for global optimization application to concave minimization and D.C. optimization problems[J]. Math. Program, 1989, 41: 161-183.[4] Ng C K, Zhang L S, Li D. Discrete filled function method for discrete global optimization[J]. Comput. Optim. Appl., 2005, 31(3): 357-379.[5] Ng C K, Li D, Zhang L S. Discrete global descent method for discrete global optimization and nonlinear integer programming[J]. J. Global Optim., 2007, 67(3): 357-379.[6] Shang Y L, Zhang L S. A filled function method for finding a global minimizer on global integer optimization[J]. J. Comput. Appl. Math., 2007, 37(3): 357-379.[7] Woon S F, Rehbock V. A critical review of discrete filled function methods in solving nonlinear discrete optimization problems[J]. Appl. Math. Comput., 2010, 217(1): 25-41.[8] Lin H, Wang Y, Fan L, Gao Y L. A new discrete filled function method for finding global minimizer of integer programming[J]. Appl. Math. Comput., 2013, 219: 4371-4378.[9] Yang Y L, He M L, Gao Y L. Discrete Global Optimization Problems with a Modified Discrete Filled Function[J]. J. Oper. Res. Soc. China, 2015, 3: 297-315.[10] Shang Y L, Zhang L S. Finding discrete global minima with a filled function for integer programming[J]. Eur. J. Oper. Res., 2008, 189: 31-40.[11] Wang W X, Shang Y L, Zhang L S. Two-parameters quasi-filled function algorithm for nonlinear integer programming[J]. J. Zhejiang Univ-Sci. A, 2006, 7(12): 2083-2087.[12] Li M X, Shang Y L, Wang G L. Modified filled function to solve nonlinear programming problem[J]. Math. Comput., 2015, 2: 50-55. |
