.png){kind=icon}
返回
A new filled function method for nonlinear integer programming problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.04.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we develop a new filled function method to solve nonlinear integer programming problem. It is shown that any local minimizer of the new filled function constructed from a current local minimizer is either a better local minimizer of the original integer programming problem or a vertex of its constrained domain. Hence a better local minimizer can be obtained just by local search scheme for the new filled function. An algorithm based on the nice properties of the new filled function is proposed for locating the global minimizer of the original integer programming problem. Several numerical examples are presented to show the efficiency of the algorithm. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
integer programming
filled function method
discrete global minimizer
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容