IE 3034 • Midterm I • Operations Research II

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Djikstra's Algorithm Example 1

Djikstra's Algorithm Example 2

Shortest Path Problem Example 1

Shortest Path Problem Example 2

Shortest Path Problem Example 3

What is a Minimum Spanning Tree?

Prim's Algorithm

MST Example 1

MST Example 2

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Method (Flow Augmenting Path Algorithm)

Ford Fulkerson Method Example 1

Ford Fulkerson Method Example 2

Boss of Network Problems

MCNFP Example 1

Step 1: Finding Initial BFS

Step 2: Finding Entering Variable

Step 3: Finding Leaving Variable & Pivoting

Let's Continue with Iterations

What is Integer Programming?

Fixed Cost Problems

Fixed Cost Problems Example 1

Exam Like Question 1

Constraints with Binary Variables

Special Constraints

Minimal Spanning Problem 1

Minimal Spanning Problem 2

Minimal Spanning Problem 3

Shortest Route Problems 1

Shortest Route Problems 2

Shortest Route Problems 3

Shortest Route Problems 4

Shortest Route Problems 5

Maximum Flow Problem 1

Maximum Flow Problem 2

Maximum Flow Problem 3

Minimum Cost Flow Problem 1

Minimum Cost Flow Problem 2

Network Simplex Method

Integer Programming 1

Integer Programming 2

Integer Programming 3

Integer Programming 4

Integer Programming 5

Integer Programming 6

Integer Programming 7

Integer Programming 8

Integer Programming 9

Integer Programming 10