摘要
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.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 25-32 |
| 页数 | 8 |
| 期刊 | Journal of Computational Mathematics |
| 卷 | 24 |
| 期 | 1 |
| 出版状态 | 已出版 - 1月 2006 |
| 已对外发布 | 是 |