This preview shows page 1. Sign up to view the full content.
Unformatted text preview: for basic problems of combinatorial optimization: the shortest path problem, the maxow problem, the mincost ow problem. Then some applications of the above material to matrix games and combinatorial minmax theorems are discussed. This is mostly Chapters 5 and 6 of the book. For applications of duality such as game theory, instructors supplements are used. After that, it is described what can be done for integer linear programs (such as Traveling Salesman Problem or scheduling problems). This is Chapters 13 and 14 and instructors supplement. Then the important in combinatorial optimization notion of matroids is duscussed. This is Chapter 12 and instructors supplement. Also some ideas of dynamic programming and branchandbound are introduced and discussed. This is a part of Chapter 18. Prerequisite : Math 415 or equivalent...
View
Full
Document
This note was uploaded on 02/19/2012 for the course MATH 482 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.
 Spring '08
 Staff
 Linear Programming, Dynamic Programming

Click to edit the document details