Algorithm for fractional knapsack 1. W and item have value Viand weight Wi. 2. Rank item by value/weight ratio: Vi/Wi. 3. Thus : Vi/Wi= Vj/Wjfor all i<=Wj. 4. Consider items in order of descending ratio. 5. Take as much of each item is possible. 6. Assume value and weight...
Thereafter, the SM model has been successfully applied to solve combinatorial optimization, including the knapsack problem [26], traffic network optimization [27, 28], load-shedding problem [29], supply chain network design [30, 31], etc. This model attracts our attention because apparently, the...