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: This paper proposes a modified iterated greedy algorithm for solving an NP-hard knapsack problem known as the knapsack problem with setup. In contrast to the classical 0-1 knapsack problem, ...

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 ...