Now showing items 1-1 of 1

    • Heuristics for the Knapsack Problem 

      Gilbertson, Claire (2008-04-01)
      We explore the knapsack problem where the goal is to maximize the value of packed objects for a certain container. The knapsack problem is NP-complete which means the time needed to solve it exactly grows exponentially as ...