1. Chapter 11 Network Models

2. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is the model for? (Applications) –Solve it by QM You do not need to know the solution technique since QM does it for us. But given an application, you should tell which model fit the application and solve it by QM.

3. Minimum Spanning Tree Problem Given costs (distances) between nodes, find a network (actually a “tree”) that covers all the nodes with minimum total cost. Applications: Planning water pipe, power cable, or phone line to the residents in a community. Example: p.430

4. Maximum Flow Problem Given flow-capacities between nodes, find the maximum amount of flows from the origin node to the destination node. Applications: Capacity of traffic flows between two points of a city. Example: p.434

5. Shortest Route Problem Given distances (costs) between nodes, find the shortest route between any pair of nodes. Applications: Find the shortest route from one place to another. Example: p.440