Salim Bouamama

Learn More
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, items belong to different classes, and choosing at least one item from a specific class causes a class setup capacity to be consumed and a reduction of the total(More)
Iterated greedy algorithms belong to the class of stochastic local search strategies that have been shown to be very successful for solving a considerable number of difficult optimization problems. They are based on the simple and effective principle of generating a sequence of solutions by iterating over a constructive greedy heuristic using destruction(More)
  • 1