The purpose of this course is to familiarize students with graph and network optimization techniques in Industrial Engineering and Operations Research. New developments in the field have led to surprisingly efficient and powerful techniques for solving many of these optimzation prblems. The theoretical background of these tecniques will be examined along with their computer implementations. Numerous engineering applications are stressed throughout the course. Lectures and discussions are to be provided for some of the following topics among many others:

• Shortest Paths and K-Shortest Paths
  
• Turn Penalty Problems
  
• Minimum Spanning Trees
  
• Travelling Salesman Problems
  
• Maximal Flows
  
• Multi-terminal Maximum Flows
  
• Minimum Cost Networks
  
• Project Networks and Time-Cost Tradeoffs
  
• Generalize Network Flows with Gains/Losses
  
• Stochastic Networks
• Multi-Commodity Flow Networks
  

Textbook: Phillips, D.J. and A. Garcia-Diaz, Fundamentals of Network Analysis. Prentice-Hall.
Available from UMass.

Prerequisites: Linear Algebra is the only necessary prerequisite. Linear Programming is introduced in the course as background material for the algorithms at the beginning of the course and as needed to understand the theory behind the algorithms. For those with an introductory course in Operations Research, this is ample background.

Evaluation: Students will be evaluated on their performance via the following breakdown:

• Homeworks 30% (once every two weeks)
• Midterm 30%
• Final Exam 40%
• Course Syllabus
• Reading Guide
• Homework #1
• Homework #2
• Homework #3
• Homework #4 mentioned on the tapes
• Homework #5
  

---

Software:
PC Programs available from Professor Smith and PEEAS

---