[1] Ge, R.P., 1990. A filled function method for finding a global minimizer of a function of several variables. Mathematical Programming, 46(1-3):191-204.
[2] Ge, R.P., Qin, Y.F., 1990. The global convexized filled functions for globally optimization. Applied Mathematics and Computation, 35(2):131-158.
[3] Lucidi, S., Piccialli, V., 2002. New classes of globally convexized filled functions for global optimization. Journal of Global Optimization, 24(2):219-236.
[4] Shang, Y.L, Han, B.S., 2005. One-parameter quasi-filled function algorithm for nonlinear integer programming. Journal of Zhejiang University SCIENCE, 6A(4):305-310.
[5] Shang, Y.L, Zhang, L.S., 2005. A filled function method for finding a global minimizer on global integer optimization. Journal of Computational and Applied Mathematics, 181(1):200-210.
[6] Zhu, W.X., 2000. A filled function method for nonlinear integer programming. Chinese ACTA of Mathematicae Applicatae Sinica, 23(4):481-487.
[7] Zhang, L.S., Gao, F., Zhu, W.X., 1999. Nonlinear integer programming and global optimization. Journal of Computational Mathematics, 7(2):179-190.
Open peer comments: Debate/Discuss/Question/Opinion
<1>