IND 311 • Final • Operations Research II

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Example 1

Example 2

Example 3

Example 4

Example 5

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Algorithm

Example 1

Example 2

What is a project network?

Drawing a Project Network

Example 1

Critical Path Method (CPM)

Example 2

Total & Free Float

Example 3

A New Approach to Optimization Problems

Inventory Problems

Example 1

Example 2

Resource Allocation Problems

Example 3

Example 4

Example 5

Network Models - Shortest Path Problem 1

Network Models - Shortest Path Problem 2

Network Models - Shortest Path Problem 3

Network Models - Shortest Path Problem 4

Network Models - Shortest Path Problem 5

Network Models - Maximum Flow Problem 1

Network Models - Maximum Flow Problem 2

Network Models - Maximum Flow Problem 3

Network Models - Maximum Flow Problem 4

Project Management 1

Project Management 2

Dynamic Programming 1

Dynamic Programming 2

Dynamic Programming 3

Dynamic Programming 4

Dynamic Programming 5

Dynamic Programming 6

Dynamic Programming 7

Network Models - Shortest Path Problem 1

Network Models - Shortest Path Problem 2

Network Models - Maximum Flow Problem 1

Network Models - Maximum Flow Problem 2

Project Management 1

Dynamic Programming 1

Dynamic Programming 2

Dynamic Programming 3