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.

FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；

youdao

And also, the algorithm for calculating the optimal weight vector is given.

还给出了计算最优权值矢量的算法。

youdao