Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Branch-And-Bound Algorithm for Seeking the p-Median

Pertti Järvinen, Jaakko Rajala and Heikki Sinervo
Operations Research
Vol. 20, No. 1 (Jan. - Feb., 1972), pp. 173-178
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169349
Page Count: 6
  • Download ($30.00)
  • Cite this Item
A Branch-And-Bound Algorithm for Seeking the p-Median
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
173
    173
  • Thumbnail: Page 
174
    174
  • Thumbnail: Page 
175
    175
  • Thumbnail: Page 
176
    176
  • Thumbnail: Page 
177
    177
  • Thumbnail: Page 
178
    178