INSTRUCTOR
<br>林東盈 (Dung-Ying Lin); Email: dylin@ie.nthu.edu.tw
<br>
<br>TEXTBOOK
<br>1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993). Network Flows: Theory, 
<br>Algorithms and Applications. Prentice Hall, New Jersey.
<br>
<br>2. Wolsey, L.A. (1998). Integer Programming. John Wiley & Son.
<br>
<br>3. Nemhauser, G. L. and Wolsey, L. A. (1988) Integer and Combinatorial 
<br>Optimization. John Wiley & Son.
<br>
<br>4. Hillier, F.S. and Lieberman, G.J. (2009) Introduction to Operations Research. 
<br>McGraw Hill. 10th edition.
<br>
<br>COURSEWORK REQUIREMENTS 
<br>Homework assignments and presentation: 20%
<br>Midterm examination I*: 25%
<br>Midterm examination II*: 25%
<br>Final examination*: 30%
<br>*No make-up exam
<br>
<br>TENTATIVE TOPICS AND SCHEDULE
<br>1. Integer Programming Formulation
<br>2. Totally Unimodular
<br>3. Paths, Trees and Cycles
<br>4. Search Algorithms
<br>5. Shortest Path Problem-Label Setting Algorithm: Dijkstra’s Algorithm
<br>6. Shortest Path Problem-Label Correcting Algorithm: Dequeue Implementation
<br>7. Maximum Flows
<br>8. Midterm Exam I
<br>9. Minimum Cost Flows
<br>10. Minimum Spanning Trees
<br>11. Lagrangian Relaxation and Network Optimization
<br>12. Multicommodity Flows
<br>13. Midterm Exam II
<br>14. Branch and Bound Algorithm
<br>15. Cutting Plane Algorithm
<br>16. Final Exam
<br>