AbstractWe investigate the convergence properties of the Weiszfeld procedure when it is applied to the approximated ℓp-norm single-facility location problem where p > 2. We show that convergence for p > 2 can be obtained by introducing a step size factor to the iterative procedure. Some numerical test results are also given
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
A new and simple methodology is proposed to solve both constrained and unconstrained planar continu...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
AbstractWe investigate the convergence properties of the Weiszfeld procedure when it is applied to t...
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocatio
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
AbstractWe develop a generalized bounding method for the Weiszfeld iterative procedure used to solve...
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
This paper addresses the general continuous single facility location problems in finite dimension s...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
Abstract. The Weiszfeld algorithm for continuous location problems can be considered as an iterative...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
A new and simple methodology is proposed to solve both constrained and unconstrained planar continu...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
AbstractWe investigate the convergence properties of the Weiszfeld procedure when it is applied to t...
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocatio
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
AbstractWe develop a generalized bounding method for the Weiszfeld iterative procedure used to solve...
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
This paper addresses the general continuous single facility location problems in finite dimension s...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
Abstract. The Weiszfeld algorithm for continuous location problems can be considered as an iterative...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
A new and simple methodology is proposed to solve both constrained and unconstrained planar continu...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
DOI
Add to ORKG