Abstract
The Filled Function Method is a class of effective algorithms for continuous global optimization. In this paper, a new filled function method is introduced and used to solve integer programming. Firstly, some basic definitions of discrete optimization are given. Then an algorithm and the implementation of this algorithm on several test problems are showed. The computational results show the algorithm is effective.
| Original language | English |
|---|---|
| Pages (from-to) | 25-32 |
| Number of pages | 8 |
| Journal | Journal of Computational Mathematics |
| Volume | 24 |
| Issue number | 1 |
| Publication status | Published - Jan 2006 |
| Externally published | Yes |
Keywords
- Filled function method
- Global minimization
- Integer programming