A projected Weiszfeld algorithm for the box-constrained Weber location problem

DOI10.1016/J.AMC.2011.08.041MaRDI QIDQ425491zbMATH OpenOpenAlexFDO

Authors Elvio A. Pilotta, Germán A. Torres

Publication date 8 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.08.041

zbMATH Keywords

box constraintsfixed-point iterationWeber problemlocation problemsWeiszfeld algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Recommendations

• scientific article; zbMATH DE number 1803754
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• Local convergence in a generalized Fermat-Weber problem
• The Fermat-Weber location problem revisited
• A heuristic algorithm for constrain single-source problem with constrained customers

Cites work

• scientific article; zbMATH DE number 1253040 (Why is no real title available?)
• scientific article; zbMATH DE number 1054765 (Why is no real title available?)
• scientific article; zbMATH DE number 1855792 (Why is no real title available?)
• scientific article; zbMATH DE number 3291744 (Why is no real title available?)
• A BSSS algorithm for the single facility location problem in two regions with different norms
• A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
• A destination optimality in asymmetric distance Fermat-Weber problems
• A guided reactive GRASP for the capacitated multi-source Weber problem
• A note on Fermat's problem
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• A quadratically convergent method for minimizing a sum of euclidean norms
• A subgradient algorithm for certain minimax and minisum problems
• Accelerating convergence in the Fermat-Weber location problem
• An algorithm for the solution of a location problem with metric constraints
• An efficient algorithm for facility location in the presence of forbidden regions
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• Duality theorem for a generalized Fermat-Weber problem
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• Further notes on convergence of the Weiszfeld algorithm
• Local convergence in a generalized Fermat-Weber problem
• Location of a facility minimizing nuisance to or from a planar network
• New heuristic methods for the capacitated multi-facility Weber problem
• On the convergence of the Weiszfeld algorithm
• On the convergence of the generalized Weiszfeld algorithm
• On the point for which the sum of the distances to \(n\) given points is minimum
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• The Fermat-Weber location problem revisited
• The Weber problem with regional demand
• The linearized version of an algorithm for the mixed norms problem
• The multi-facility location-allocation problem with polyhedral barriers

Cited in

(9)

• scientific article; zbMATH DE number 3869027 (Why is no real title available?)
• An algorithm for generalized constrained multi-source Weber problem with demand substations
• A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
• An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
• A projection-type method for solving various Weber problems
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• On a projected Weiszfeld algorithm
• A heuristic algorithm for constrain single-source problem with constrained customers
• An iterative method for solving the Weber problem in \(\mathbb{R}^2\) with \(l_p\) norms, \(p\in (1,2)\), based in linear programming

This page was built for publication: A projected Weiszfeld algorithm for the box-constrained Weber location problem

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