- Category:
- matlab
- Tags:
-
[Matlab]
[源码]
- File Size:
- 13.68kb
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
- 孙竟飞
Description: 1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?
- [0-1programming] - 0-1 Integer Programming is a very broad
- [AI_lovebit] - classical AI Artificial Intelligence por
- [MCRGSA] - MCRGSA------ Multicast Routing genetic s
- [KnapsackProblem] - This is a typical knapsack problem in th
- [Antbeibao] - Using ant colony algorithm to solve 0-1
- [GA] - This procedure is in the MATLAB platform
- [matlab] - Good program, please download, climbing
- [01bagProblemGreedy] - 0/1 knapsack problem greedy optimization
- [QEAsolvePackage] - The more popular the last two years the
- [beibaoPSO] - The source code is the particle swarm al
File list (Check if you may need any files):
Download