Abstract:
Given a set of customers, we want to minimize the time a delivery person needs to deliver all their packages. We must take factors such as the time it takes to find parking and the capacity of the delivery person into account. In this talk, we will formulate this problem as an integer program and visually be able to see what the optimal routes look like. The talk will include a general introduction to integer programming and a discussion on combinatorics.