Graham Shaw Mathematics Senior Thesis Presentation

Graham will discuss “Branching and Bounding Through the Knapsack Problem.” The classic Knapsack Problem asks how to choose among a set of items, each with a given weight and value, so that the total weight is less than or equal to a given capacity and the total value is as large as possible. This talk will contain an overview of some algorithms available that can help us intelligently enumerate a solution space for variations of the Knapsack Problem.