For Programmers: Free Programming Magazines  


Home > Archive > Matlab > April 2005 > Solving k-center and facility location problem









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

Author Solving k-center and facility location problem
Ferenc Stelcz

2005-04-22, 9:00 am

Hello!

I'm looking for example source codes on solving k-center problems on
undirected graphs.

The exact problem is that given are points of a graph and weights of
those points. Given are the edges between points in form of a matrix
and a matrix with distance of points (e.g. Edges(i,j) == 1 if there
is a connection between points i and j and 0 if not and Dists(i,j) ==
some integer). Now I have to select N points of the graph so that the
weighted distance of a selected point to others is minimal. Formal: :
min(maxi wi distance(xi,V)) where distance(xi,V) = minj(
distance(xi,vj)) and wj is the weight of the j-th point in the graph.

Can somebody help me to get a working source?

Thanks in advance!
Ferenc Stelcz

2005-04-22, 9:00 pm

Ok, I've made it. I've written a code that does a random placement of
facilities and searches for the minimal weighted distances for each
point<->nearest facility.
Sponsored Links







Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive

Copyright 2008 codecomments.com