Abstract: 0-1 knapsack problem is a typical NP complex issues in field of computer. Traditional solve knapsack problem is recursively backtracking and greedy methods. Use recursive backtracking to ...

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car ...

Abstract: In order to overcome the disadvantages of the traditional genetic algorithm and improve the speed and precision of the algorithm, the author improved the selection strategy, integrated the ...