文件名称:Backbag
- 所属分类:
- 数据结构常用算法
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 939kb
- 下载次数:
- 0次
- 提 供 者:
- 方**
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为:给定一组物品,每种物品都有自己的重量和价格,在限定的总重量内,我们如何选择,才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。-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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
背包问题\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
背包问题
........\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
背包问题