Finding -Hub Median Locations: An Empirical Study on Problems and Solution Techniques

Algorithm 2

Finding the upper bound for Lagrangian relaxation.

  for node in :

if :

find the nearest hub k from node

set ,

set

endif

  endfor