Description: Knapsack problem to achieve the three greedy strategy, knapsack problem described as follows: It is known knapsack capacity M = 120 the number of n = 10 categories of items of various items of the total benefits pi (i = 1,2, ... ... ... 10): 50,60 , 70,80,90,80,70,60,50,40 total weight of all kinds of items wi (i = 1,2 ... ... ... 10): 17,30,25,41,80,70,64,56 , 47,38 seeking: all kinds of items by taking the ratio of the weight of its total weight of xi (i = 1,2, ... .. 10), satisfy 0 < = xi < = 1, and and making the maximum.
To Search:
File list (Check if you may need any files):
shuanfa1\test\Debug\test.exe
........\....\.....\test.ilk
........\....\.....\test.obj
........\....\.....\test.pch
........\....\.....\test.pdb
........\....\.....\vc60.idb
........\....\.....\vc60.pdb
........\....\test.cpp
........\....\test.dsp
........\....\test.dsw
........\....\test.ncb
........\....\test.opt
........\....\test.plg
........\....\Debug
........\test
shuanfa1
Download