INDR 363 • Midterm • Mathematical Programming

What is a network?

Shortest Path Problems

Solving Shortest Path Problems: Dijkstra's Algorithm (NEW)

Example 1 (NEW)

Example 2 (NEW)

Dijkstra's Algorithm

Example 1

Example 2

Example 3

What is a Minimum Spanning Tree?

Prim's Algorithm

Example 1

Example 2

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Algorithm

Example 1

Example 2

Boss of Network Problems

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?

Constraints with Binary Variables

Special Constraints

Fixed Charge Problems

Example 1

Assignment Problems

Example 2

Set Covering Problems

Example 3

Introduction

Example 1

Example 2

An Important Question

Knapsack Problem and Branch&Bound

Knapsack Problemi B&B Example

SPP 1 (NEW)

SPP 2 (NEW)

SPP 3 (NEW)

SPP 4

SPP 5

SPP 6

SPP 7

SPP 8

MST 1

MST 2

MST 3

MFP 1

MFP 2

MFP 3

MCNFP 1

MCNFP 2

Network Simplex Method

IP Modeling 1

IP Modeling 2

IP Modeling 3

IP Modeling 4

Branch and Bound 1

Branch and Bound 2

Branch and Bound 3