| Article ID: | iaor20011513 |
| Country: | United States |
| Volume: | 93 |
| Issue: | 2/3 |
| Start Page Number: | 183 |
| End Page Number: | 193 |
| Publication Date: | Jul 1998 |
| Journal: | Applied Mathematics and Computation |
| Authors: | Zhu W.X. |
This paper presents an approximate algorithm, which is modified from the Filled Function method for continuous global optimization, to solve nonlinear integer programming problems. Unlike the other approximate methods, the algorithm tries to improve a discrete local minimal solution by minimizing a filled function. It is a direct method. Numerical experiments show that this algorithm is efficient.