.png){kind=icon}
返回
Non-linear integer programming by Darwin and Boltzmann mixed strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00024-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Non-linear integer programming (NIP) is a NP-complete problem with extensive theoretical and practical backgrounds. Based on our proposed Darwin and Boltzmann mixed strategy, this paper presents a general stochastic iterative algorithm for the NIP problems. The algorithm synthesizes the advantages of the Darwin strategy and the Boltzmann annealing strategy. It converges asymptotically to the global optimums and has shown to be polynomial in complexity. The experimental evaluations also show that the proposed algorithm is more efficient than the simulated annealing algorithm. (C) 1998 Elsevier Science B.V.
Keyword:
optimization
non-linear integer programming
Darwin and Boltzmann mixed strategy
global convergence
polynomial algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
.png){kind=icon}
没有更多内容