October 15, 2019
Professor Dick Forrester will present "Adventures in Nonlinear Boolean Optimization: The 0-1 Quadratic and Cubic Knapsack Problems". Free pizza and everyone is welcome to attend.
The knapsack problem is a classical problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in a knapsack so that the total weight is less than or equal to the capacity and the total value is maximized. In this talk we will learn about quadratic and cubic extensions of the classical knapsack problem. We will discuss both heuristic and exact solutions methods, and in particular we will see how a simple reordering of the variables can affect algorithmic performance.
Further information
- Location: Tome 115
- Time: 12:00 pm - 1:00 pm
- Cost: Free