Exact and approximate solutions to the multisource weber problem

The problem considered is the choice of locations form sources so as to minimize the sum of weighted distances betweenn fixed sinks and the source closest to each sink. The weights represent the amounts to be shipped between the sinks and their respective sources; the allowable source locations are free of restriction. An algorithm for the approximate solution of the problem, and computational experience with it, are discussed first. A branch-and-bound algorithm for exact solution of the problem is then developed, and computational experience with it is described.