Technical Note—An Algorithm for the p-Median Problem
- 1 August 1977
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 25 (4) , 709-713
- https://doi.org/10.1287/opre.25.4.709
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: