1. Facility Location and Network Design Models

2. Facility Location Assumptions Based on graph G=(V,E) Demand nodes, I  V, are known and fixed Set J  V of possible facility locations Note: I and J may have common nodes Edges (i,j)  E indicate it is possible for demand at node i(j) to be directly satisfied if facility is located at node j(i) “distance” between nodes i and j is d ij

4. Set Covering Location Problem

5. Maximal Covering Location Problem

6. p-Center Problem

7. p-Median Problem

8. Fixed-Charge Location Problem

9. Local p-Median Problem

10. Network Flow Model

11. Network Design Problem