Local convexity results in a generalized Fermat-Weber problem

DOI10.1016/S0898-1221(99)00102-9MaRDI QIDQ1806490zbMATHFDO

Authors Jack Brimberg, Robert F. Love

Publication date 8 November 1999

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

convergenceconvexityFermat-Weber problem

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Local convergence in a generalized Fermat-Weber problem
• The Fermat-Weber location problem revisited
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• On the convergence of the generalized Weiszfeld algorithm

Cites work

• A note on Fermat's problem
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• General Considerations on the Use of the Weighted lp Norm as an Empirical Distance Measure
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Local convergence in Fermat's problem
• Local convergence in a generalized Fermat-Weber problem
• Mathematical Models of Road Travel Distances
• Modelling Inter-city Road Distances by Mathematical Functions
• On convexity proofs in location theory
• On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
• On the uniqueness of optimal solutions in continuous location theory
• Some Properties of Location Problems with Block and Round Norms
• The Single Source Weber Problem -- Survey and Extensions

Cited in

(3)

• Accelerating convergence in the Fermat-Weber location problem
• Facility location in normed linear spaces
• A geometric characterisation of the quadratic min-power centre

This page was built for publication: Local convexity results in a generalized Fermat-Weber problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806490)