摘要
分析了ＣＦ－ＰＣＧ算法的效率随其参数的变化性质，将参数σ，ｐ的确定，由求解整数规划子问题转化为确定一个不等的上界，从而减少求解参数的计算量，使ＣＦ－ＰＣＧ算法的实现更加方便．
The property that the efficiency of CF-PCG algorithm varies with its different algorithmic parameters is analyzed. The determination of parameters σ and ｐ is converted into the definition of an inequal upper boundary from solving integer programming problem, which decreases the calculation of solving parameters so that the application of CF-PCG algorithm in pactice is more convenient.
出处
《北京工业大学学报》
CAS
CSCD
北大核心
2001年第2期174-177,共4页
Journal of Beijing University of Technology
基金
国家自然科学基金资助项目(19671010).
