Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median

Pertti Järvinen · Jaakko Rajala · Heikki Sinervo

67 citations0/0 files storedOperations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 67 citations exist upstream.

Cited by

1975A computation procedure for the exact solution of location‐allocation problems with rectangular distances 1979A Note Comparing Optimal and Heuristic Solutions To the p‐Median Problem 1982Locating mobile servers on a network with markovian properties 1994Chapter 6 The deployment of police, fire, and emergency medical units 1974Hierarchical location analysis for integrated area planning in Rural India 1974HIERARCHICAL LOCATION ANALYSIS FOR INTEGRATED AREA PLANNING IN RURAL AREAS 2004Uncapacitated facility location problems: contributions 1991Fast primal and dual heuristics for the p-median location problem

Imported from OpenAlex (CC0) — nothing here is generated.