TITLE

A Dual-Bounded Algorithm for the p-Median Problem

AUTHOR(S)
Galv√£o, Roberto O.
PUB. DATE
September 1980
SOURCE
Operations Research;Sep/Oct80, Vol. 28 Issue 5, p1112
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The p-median problem consists of locating p facilities on a network, so that the sum of shortest distances from each of the nodes of the network to its nearest facility is minimized. A dual bound, based on the dual of the LP relaxation of the integer programming formulation of the problem, is developed and tested in a branch-and-bound algorithm. Computational results show that the resulting solution procedure has some advantages over existing exact methods for this problem.
ACCESSION #
4473079

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics