This course introduces the theory and characteristics of network and integer programming problems. In network models, basic graph theory along with network optimization algorithms is included to have a comprehensive understanding in real-world applications. Introduction to integer programming problems includes traveling salesman problems as well as detail study of valid inequalities and branch-and-bound method, along with the concepts, techniques, mathematical analysis and justification. Emphasis is placed on the modeling and the use of commercial software.
Week 1~3 Linear Programming Modeling Week 4~7 Network Optimization Modeling Week 8 Midterm Exam Week 9~13 Integer Programming Modeling Week 14~17 Application of Integer Programming Models Week 18 Term Project Presentation
Homework Assignments:40% Mid-term Exam: 30% Term Project: 30%
Eiselt, H.A. and Sandblom, C.-L. (2000), Integer Programming and Network Models