Description: Greedy algorithm for knapsack problem, respectively, obtained three standard 1. Press-effective value of descending and remove things. 2. By weight the value of items taken from small to big 3. According to the ratio of pi/wi check the value of descending The first of these three kinds of goods is the optimal solution
To Search:
- [tsp] - TSP's intelligent algorithm, which conta
- [beibao] - Through the greedy algorithm knapsack pr
- [KITBAG] - Knapsack problem is a greedy algorithm w
- [tanxin] - Complete knapsack problem (C++ source co
File list (Check if you may need any files):
GreedyBag.cpp
Download