The robustness of two common heuristics for the p-median problem
Optimal p- median solutions were computedfor six test problems on a network of forty-nine demand nodes and compared with solutions from two heuristic algorithms. Comparison of the optimal solutions with those from the Teitz and Bart heuristic indicates that this heuristic is very robust. Tests of the Maranzana heuristic, however, indicate that it is efficient only for small values of p (numbers of facilities) and that its robustness decreases rapidly as problem size increases.
When requesting a correction, please mention this item's handle: RePEc:pio:envira:v:11:y:1979:i:4:p:373-380. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond)
If references are entirely missing, you can add them using this form.