Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm

Abstract

The classical iterative algorithm originally proposed by Weiszfeld for solving minisum facility location problems is generalized to the case of Ip distances. A differentiate approximating function is used to replace the original nondifferentiable convex objective function. The approximating function is shown to be uniformly convergent to the original objective function as a smoothing constant approaches zero. Characterizations and convergence properties peculiar to the algorithm are discussed, and computational experience is presented. The straightforward extension to multifacility location problems is also developed.

Cite this work

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

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

Papers that cite the same references — the relational fallback while embeddings are still backfilling.