提出了解决多背包问题的遗传算法。

A genetic algorithms is applied to solute such a complex problem.

youdao

然后从计算方法上，将该贷款组合优化问题归结为一类有上下限的非连续、多峰的特殊背包问题。

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.

youdao

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.

youdao