The solution process is described with the solution of 0/1knapsackproblem.
结合0 / 1背包问题的求解,阐明这种方法求解问题的过程。
2
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1knapsackproblem, whereby the optimal clearing vector can be found with dynamic programming.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题,从而可用动态规划寻求最佳的出清向量;
3
Algorithm design and analysis of the classic procedure, mainly 0-1knapsackproblem, such as minimum spanning tree.