Facility Location and Network Design Models

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

Set Covering Location Problem

Maximal Covering Location Problem

p-Center Problem

p-Median Problem

Fixed-Charge Location Problem

Local p-Median Problem

Network Flow Model

Network Design Problem