TY - JOUR
T1 - Discrete filled function method for discrete global optimization
AU - Ng, Chi-Kong
AU - Zhang, Lian-Sheng
AU - Li, Duan
AU - Tian, Wei-Wen
PY - 2005/5
Y1 - 2005/5
N2 - 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.
AB - 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.
KW - Discrete filled function method
KW - Discrete global optimization
KW - Linear integer programming
KW - Nonlinear integer programming
KW - Quadratic integer programming
UR - http://www.scopus.com/inward/record.url?scp=18844451467&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-18844451467&origin=recordpage
U2 - 10.1007/s10589-005-0985-7
DO - 10.1007/s10589-005-0985-7
M3 - RGC 21 - Publication in refereed journal
SN - 0926-6003
VL - 31
SP - 87
EP - 115
JO - Computational Optimization and Applications
JF - Computational Optimization and Applications
IS - 1
ER -