Description: Using genetic algorithm to solve the 0-1 knapsack problem, that is, limited capacity into objects, each object has a different value, making the final value of the maximum
To Search:
File list (Check if you may need any files):
遗传算法解决0-1背包问题源程序
.............................\beibao.cpp
.............................\beibao.dsp
.............................\beibao.dsw
.............................\beibao.ncb
.............................\beibao.opt
.............................\beibao.plg
.............................\Debug
.............................\.....\beibao.exe
.............................\.....\beibao.ilk
.............................\.....\beibao.obj
.............................\.....\beibao.pch
.............................\.....\beibao.pdb
.............................\.....\vc60.idb
.............................\.....\vc60.pdb
Download