Median Problem o Nodal weights h;, representing fraction of customers from node j ● Sum of h; s equals one o We have an undirected network G(N, A) o Objective: locate k facilities onG such that mean travel distance to a closest facility is minimizedMedian Problem Median Problem z Nodal weights hj, representing fraction of customers from node j z Sum of hj's equals one. z We have an undirected network G(N,A) z Objective: locate k facilities on G such that mean travel distance to a closest facility is minimized