IE 343 • Mathematical Modeling and Exact Methods • Final

Introduction

Mathematical Modelling

Example 1

Example 2

Dijkstra’s Algorithm

Example 3

Example 4

Dijkstra’s Algorithm’s Pseudocode

Bellman-Ford Algorithm

Example 5

Example 6

Bellman-Ford Algorithm’s Pseudocode

Shortest Path Problem 1

Shortest Path Problem 2

Shortest Path Problem 3

Shortest Path Problem 4

Shortest Path Problem 5

Shortest Path Problem 6

Shortest Path Problem 7

Shortest Path Problem 8

Shortest Path Problem 9

Shortest Path Problem 10

Introduction

p-Median

p-Median Mathematical Modelling

Example 1

p-Median Greedy Algorithm

Example 2

p-Center

p-Center Mathematical Modelling

Example 3

p-Center Greedy Algorithm

Example 4

p-Hub Median

p-Hub Median Mathematical Modelling

Linearization

Example 5

Example 6

Facility Location Problems 1

Facility Location Problems 2

Facility Location Problems 3

Facility Location Problems 4

Facility Location Problems 5

Facility Location Problems 6

Facility Location Problems 7

Facility Location Problems 8

Facility Location Problems 9

Facility Location Problems 10

Introduction

Mathematical Modelling

Example 1

Miller-Tucker-Zemlin

Example 2

Example 3

Dantzig-Fulkerson-Johnson

Example 4

Example 5

Nearest Neighbor Algorithm

Nearest Neighbor Algorithm’s Pseudocode

Iterative NN

Randomized NN

Example 6

1-Opt Move

Example 7

2-Opt Move

Example 8

Travelling Salesman Problem 1

Travelling Salesman Problem 2

Travelling Salesman Problem 3

Travelling Salesman Problem 4

Travelling Salesman Problem 5

Travelling Salesman Problem 6

Travelling Salesman Problem 7

Travelling Salesman Problem 8

Travelling Salesman Problem 9

Travelling Salesman Problem 10

Travelling Salesman Problem 11