Description: There are several cargo, goods, i, weight W (i) the value of P (i). Truck load of C. Q followed by loading a truck how to choose your best buy the goods. Respectively, using the greedy method and dynamic programming algorithm to solve this problem.
To Search:
File list (Check if you may need any files):
算法设计实验三.doc
Download