Chapter 5: Network Flow Programming Models

• 5.1 Classical Models
• 5.2 Extensions of the Basic Models
• 5.3 Linear Programming Model
• 5.4 Minimum Cost Flow Problem
• 5.6 Exercises
• Bibliography

Network Flow Programming Models

Applications

• Terminology
• Distribution Example
• Special Cases
• Other Examples

Modeling Networks with the Math Programming Add-in

• Instructions
• Add-in
  

Solving Networks with the Network Solver Add-in

• Instructions
• Add-in

Network Model Examples

• Examples from Chapter5

Chapter 6: Network Flow Programming Methods

• 6.1 Transportation Problem
• 6.2 Shortest Path Problem
• 6.3 Maximum Flow Problem
• 6.4 Pure Minimum Cost Flow Problem
• 6.5 Exercises
• Bibliography

Algorithms

• Minimal Spanning Tree (Flash)

• Shortest Path Tree (Flash)

• Transportation Simplex Demo (Flash)

• Teach Transportation Add-in
  • Instructions
  • Add-in

• Network Primal Simplex (Flash)

• Teach Network Add-in
  • Instructions
  • Add-in

Optimize Add-in Instructions

Applications

• Spanning Tree
• Path Tree
• Flow Tree

Combinatorics Add-in Instructions

Applications

• Spanning Tree
• Path Tree
• Traveling Salesman Problem