Meta-Heuristics Approach to Knapsack Problem in Memory Management
Emmanuel Ofori Oppong, Stephen Opoku Oppong, Dominic Asamoah & Nuku Atta Kordzo Abiew · Asian Journal of Research in Computer Science · 2019
The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset of items whose weight sum does not exceed a prescribed capaci...