The Fermat-Weber location problem revisited

From MaRDI portal
Publication:1924059

DOI10.1007/BF01592245zbMath0855.90075WikidataQ62065764 ScholiaQ62065764MaRDI QIDQ1924059

Jack Brimberg

Publication date: 13 October 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)




Related Items (18)

Accelerating convergence in minisum location problem with \(\ell p\) normsMinimizing differences of convex functions with applications to facility location and clusteringThe Fermat-Weber location problem in single integrator dynamics using only local bearing anglesOn the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)A projected Weiszfeld algorithm for the box-constrained Weber location problemA subgradient method with non-monotone line searchVoting with rubber bands, weights, and stringsRevisiting several problems and algorithms in continuous location with \(\ell _\tau \) normsContinuous location under the effect of `refraction'Weiszfeld's method: old and new resultsA geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problemThe big cube small cube solution method for multidimensional facility location problemsA continuous analysis framework for the solution of location-allocation problems with dense demandRank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problemAccelerating convergence in the Fermat-Weber location problemA variable-penalty alternating directions method for convex optimizationA branch-and-price approach for the continuous multifacility monotone ordered median problemA note on convergence in the single facility minisum location problem



Cites Work


This page was built for publication: The Fermat-Weber location problem revisited