nonlinear integer programming;
quadratic integer programming;
linear integer programming;
discrete global optimization;
discrete filled function method;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
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.
机构:
Xi An Jiao Tong Univ, Fac Sci, Dept Math, Xian 710049, Peoples R ChinaXi An Jiao Tong Univ, Fac Sci, Dept Math, Xian 710049, Peoples R China
Ling, Ai-Fan
Xu, Cheng-Xian
论文数: 0引用数: 0
h-index: 0
机构:
Xi An Jiao Tong Univ, Fac Sci, Dept Math, Xian 710049, Peoples R China
Xi An Jiao Tong Univ, SKLMSE Lab, Xian 710049, Peoples R ChinaXi An Jiao Tong Univ, Fac Sci, Dept Math, Xian 710049, Peoples R China
Xu, Cheng-Xian
Xu, Feng-Min
论文数: 0引用数: 0
h-index: 0
机构:
Xi An Jiao Tong Univ, Fac Sci, Dept Math, Xian 710049, Peoples R ChinaXi An Jiao Tong Univ, Fac Sci, Dept Math, Xian 710049, Peoples R China