然后从计算方法上，将该贷款组合优化问题归结为一类有上下限的非连续、多峰的特殊背包问题。
Then, analyzed from calculation methods, this model is a type of Knapsack Problem with restrictions between lower-limit and upper-limit, which is a discontinuous and multi-maximum complicated problem.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
实验证明采用这种改进的粒子群算法解决多约束背包问题切实可行， 搜索效率较高。
The result of this experiment shows that this particle swarm algorithm is available and efficient in solving multi-c…
实验证明采用这种改进的粒子群算法解决多约束背包问题切实可行， 搜索效率较高。
The result of this experiment shows that this particle swarm algorithm is available and efficient in solving multi-c…
应用推荐