Xref: utzoo comp.theory:2138 sci.math:18182
Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!think.com!zaphod.mps.ohio-state.edu!ub!acsu.buffalo.edu
From: baveja@acsu.buffalo.edu (alok baveja)
Newsgroups: comp.theory,sci.math
Subject: The p-median problem
Message-ID: <80500@eerie.acsu.Buffalo.EDU>
Date: 19 Jun 91 17:10:31 GMT
Sender: news@acsu.Buffalo.EDU
Followup-To: comp.theory
Organization: SUNY Buffalo
Lines: 15
Nntp-Posting-Host: mickey.eng.buffalo.edu

Hi,

I would like some help with the following problem:

Given n demand points in a Euclidean space, we want to locate 
p facility points so that the average distance between facilities
and the demand points is minimized.

(a.k.a. the classical p-median problem)

I am looking for a code(program) which can solve the above problem.

Any help will be appreciated.

Alok