Short communication
A note on Galvão's “A graph theoretical bound for the p-median problem”

https://doi.org/10.1016/0377-2217(83)90162-5Get rights and content

Abstract

Galvão (1981) proposed an algorithm for calculating a strong lower bound for the p-median problem on vertex-unweighted networks. It is shown that there is a mistake in the algorithm. An improved version of the algorithm is given.

References (1)

Cited by (3)

View full text