Creating Network Flow Models

• Network models in practice:
• Reasons for pervasiveness
• Real-world case studies
• Categories of network models:
• Pure networks: transportation, transshipment, assignment, shortest path, maximal flow
• Generalized flow models: networks with gains and losses
• Constrained networks: multicommodity, side-constrained
• Nonlinear networks, including fixed-charge models
• NETFORM Modeling techniques 
• Basic constructs 
• Structuring network model components
• Dynamic models
• Goal-based and multiobjective models

Network Optimization Algorithms

• Review of linear programming 
• Network simplex algorithms for all model categories 
• Primal-dual and auction algorithms 
• Software development: data structures, development and testing of computer codes

Examinations: Two exams, no comprehensive final

Homework assignments given. No computer programming will be required.

Texts:

• Ahuja, Magnanti, Orlin, Network Flows, Prentice-Hall, ISBN 013617549X (recommended)
• Glover, Klingman, Phillips, Network Models in Optimization and their Application in Practice, John Wiley, ISBN 0471571385 (required)
• Barr, Class notes, to be distributed