Solution of location problems with radial cost functions

DOI10.1016/0898-1221(84)90089-0zbMath0524.65046OpenAlexW2066727426MaRDI QIDQ584914

Reuven Chen

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90089-0

zbMATH Keywords

location problemsiterative methodWeber problemradial cost functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (10)

On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ A note on the Weber location problem ⋮ Weiszfeld's method: old and new results ⋮ Optimal location of a single facility with circular demand areas ⋮ Accelerating convergence in the Fermat-Weber location problem ⋮ Numerical solutions of inverse time fractional coupled Burgers' equations by the Chebyshev wavelet method ⋮ The convergence of the Weiszfeld algorithm ⋮ Solution of minimax problems using equivalent differentiable functions ⋮ Analytic solutions of fractal and fractional time derivative-Burgers-Nagumo equation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gradient methods of maximization
• Cauchy's method of minimization
• Stepsize analysis for descent methods
• Local convergence in Fermat's problem
• On the Fermat—Weber problem with convex cost functions
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
• A note on Fermat's problem

This page was built for publication: Solution of location problems with radial cost functions