A projected Weiszfeld algorithm for the box-constrained Weber location problem
From MaRDI portal
Publication:425491
DOI10.1016/J.AMC.2011.08.041zbMATH Open1244.65086OpenAlexW2029755646MaRDI QIDQ425491FDOQ425491
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
Recommendations
Cites Work
- A quadratically convergent method for minimizing a sum of euclidean norms
- A note on Fermat's problem
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- A BSSS algorithm for the single facility location problem in two regions with different norms
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Title not available (Why is that?)
- Local convergence in a generalized Fermat-Weber problem
- Location of a facility minimizing nuisance to or from a planar network
- On the point for which the sum of the distances to \(n\) given points is minimum
- A destination optimality in asymmetric distance Fermat-Weber problems
- 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
- On the convergence of the Weiszfeld algorithm
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- The Fermat-Weber location problem revisited
- New heuristic methods for the capacitated multi-facility Weber problem
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Title not available (Why is that?)
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
- On the convergence of the generalized Weiszfeld algorithm
- Duality theorem for a generalized Fermat-Weber problem
- Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem
- An algorithm for the solution of a location problem with metric constraints
- A subgradient algorithm for certain minimax and minisum problems
- Title not available (Why is that?)
- Further notes on convergence of the Weiszfeld algorithm
- Title not available (Why is that?)
- A guided reactive GRASP for the capacitated multi-source Weber problem
- The linearized version of an algorithm for the mixed norms problem
- The multi-facility location-allocation problem with polyhedral barriers
Cited In (9)
- Title not available (Why is that?)
- 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)
