You are not currently logged in.
Access JSTOR through your library or other institution:
A Branch-And-Bound Algorithm for Seeking the p-Median
Pertti Järvinen, Jaakko Rajala and Heikki Sinervo
Vol. 20, No. 1 (Jan. - Feb., 1972), pp. 173-178
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169349
Page Count: 6
Preview not available
We construct a branch-and-bound algorithm for seeking the p-median, and make comparisons with the vertex-substitution method of Teitz and Bart [Opns. Res. 16, 955-961 (1968)]. We show how the vertex-substitution method can lead to a local optimum, and give a heuristic method for finding a good initial solution for this method.
Operations Research © 1972 INFORMS