Accelerating the convergence in the single-source and multi-source Weber problems

DOI10.1016/j.amc.2011.12.050zbMath1241.90076OpenAlexW2091754868MaRDI QIDQ428088

Jian-lin Jiang, Kun Cheng, Li-ping Wang, Can-Can Wang

Publication date: 19 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.12.050

zbMATH Keywords

Newton methodmulti-source Weber problemlocation-allocation heuristicmodified Weiszfeld methodsingle-source Weber problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A generalized Weber problem with different gauges for different regions ⋮ On Newton's method for the Fermat-Weber location problem ⋮ A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak convergence conditions for inexact Newton-type methods
• A note on the Weber location problem
• Minisum location problem with farthest Euclidean distances
• The \(p\)-median problem: a survey of metaheuristic approaches
• Newton's method and its use in optimization
• Multi-source facility location-allocation and inventory problem
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Accelerating convergence in the Fermat-Weber location problem
• Degeneracy in the multi-source Weber problem
• A projection method for \(l_ p\) norm location-allocation problems
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• Quasi-Newton trust region algorithm for non-smooth least squares problems
• A heuristic method for large-scale multi-facility location problems
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• A globally convergent Newton method for solving strongly monotone variational inequalities
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• On the Complexity of Some Common Geometric Location Problems
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• The Euclidean Multifacility Location Problem
• Local convergence in Fermat's problem
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Heuristic Methods for Location-Allocation Problems
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• Projected Newton Methods for Optimization Problems with Simple Constraints
• A note on Fermat's problem
• A modified Weiszfeld algorithm for the Fermat-Weber location problem

This page was built for publication: Accelerating the convergence in the single-source and multi-source Weber problems