We present a branch-and-bound algorithm for solving the p-median problem. The bounds are obtained by solving the Lagrangian relaxation of the p-median problem using the subgradient optimization method. The proposed algorithm is simple, requires small core storage and computational time, and can be used for solving large problems. Comparative results are also reported.
No takes yet. Share an insight, caveat, or question.
Narula et al. (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: