摘要
A discrete filled function method is developed in this paper to solve discrete global optimization problems over "strictly pathwise connected domains." Theoretical properties of the proposed discrete filled function are investigated and a solution algorithm is proposed. Numerical experiments reported in this paper on several test problems with up to 200 variables have demonstrated the applicability and efficiency of the proposed method.
源语言 | 英语 |
---|---|
页(从-至) | 87-115 |
页数 | 29 |
期刊 | Computational Optimization and Applications |
卷 | 31 |
期 | 1 |
DOI | |
出版状态 | 已出版 - 5月 2005 |
已对外发布 | 是 |