Description: Knapsack problem (Knapsack problem) is a kind of combinatorial optimization problem of NP complete. Problems can be described as: given a set of items, each item has its own weight and price, in limited within the total weight of, how we choose, can make the total price of goods is the highest. The name of the problem comes from how to select the most suitable items placed in a given in the backpack.
To Search:
File list (Check if you may need any files):
背包问题\main.cpp
........\Package.cpp
........\Package.dsp
........\Package.dsw
........\Package.h
........\Package.ncb
........\Package.plg
........\Debug\Package.exe
........\.....\Package.obj
........\.....\Package.pdb
........\.....\vc60.pdb
........\.....\vc60.idb
........\.....\Package.pch
........\.....\main.obj
........\.....\Package.ilk
........\Package.opt
........\Debug
背包问题
Download