MIC2003: The Fifth Metaheuristics International Conference 64-1 Local Search and Memetic Algorithms for Knapsack Problems

The 0-1 knapsack problem (KP) is widely studied in the last few decades. Despite of their simple structures, KP along with its extended versions belong to the class of NP-hard problems, and several optimization techniques have been developed to solve the problems. Some major examples are branch and bound methods and dynamic programming approaches [6], problemspecifi