A projected Weiszfeld algorithm for the box-constrained Weber location problem
From MaRDI portal
Publication:425491
DOI10.1016/j.amc.2011.08.041zbMath1244.65086OpenAlexW2029755646MaRDI QIDQ425491
Germán A. Torres, Elvio A. Pilotta
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A guided reactive GRASP for the capacitated multi-source Weber problem
- Local convergence in a generalized Fermat-Weber problem
- A destination optimality in asymmetric distance Fermat-Weber problems
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The linearized version of an algorithm for the mixed norms problem
- Location of a facility minimizing nuisance to or from a planar network
- The multi-facility location-allocation problem with polyhedral barriers
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- On the point for which the sum of the distances to \(n\) given points is minimum
- On the convergence of the generalized Weiszfeld algorithm
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An efficient algorithm for facility location in the presence of forbidden regions
- Accelerating convergence in the Fermat-Weber location problem
- The Weber problem with regional demand
- Duality theorem for a generalized Fermat-Weber problem
- On the convergence of the Weiszfeld algorithm
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem
- The Fermat-Weber location problem revisited
- A BSSS algorithm for the single facility location problem in two regions with different norms
- A quadratically convergent method for minimizing a sum of euclidean norms
- New heuristic methods for the capacitated multi-facility Weber problem
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- An algorithm for the solution of a location problem with metric constraints
- A subgradient algorithm for certain minimax and minisum problems
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Further notes on convergence of the Weiszfeld algorithm
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
- A note on Fermat's problem
This page was built for publication: A projected Weiszfeld algorithm for the box-constrained Weber location problem
