Zhu, Wenxing A filled function method for integer programming. (Chinese. English summary) Zbl 0968.90051 Acta Math. Appl. Sin. 23, No. 4, 481-487 (2000). Summary: This paper modifies the filled function method [R. Ge and Y. Qin, Appl. Math. Comput. 35, 131-158 (1990; Zbl 0752.65052)], which is previously designed to solve continuous global optimization problems, to solve integer programming problems. With the definition of discrete local minimal solution of an integer programming problem, this paper presents a neighborhood search algorithm for finding a discrete local minimal solution of the problem. Then a filled function method for the integer programming problem is proposed, which tries to find a better discrete local minimal solution of the problem by minimizing a filled function. Numerical results are presented to show the effectiveness of the method. Cited in 8 Documents MSC: 90C10 Integer programming 65K05 Numerical mathematical programming methods Keywords:discrete local minimal solution; filled function method; integer programming Citations:Zbl 0752.65052 PDFBibTeX XMLCite \textit{W. Zhu}, Acta Math. Appl. Sin. 23, No. 4, 481--487 (2000; Zbl 0968.90051)