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
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
AbstractWe investigate the convergence properties of the Weiszfeld procedure when it is applied to t...
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...
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocatio
This paper addresses the general continuous single facility location problems in finite dimension s...
a b s t r a c t An iterative method is proposed for the K facilities location problem. The problem i...
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In...
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...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
AbstractThe Generalized Fermat Problem (in the plane) is: given n≥3 destination points find the poin...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
AbstractWe investigate the convergence properties of the Weiszfeld procedure when it is applied to t...
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...
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocatio
This paper addresses the general continuous single facility location problems in finite dimension s...
a b s t r a c t An iterative method is proposed for the K facilities location problem. The problem i...
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In...
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...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
AbstractThe Generalized Fermat Problem (in the plane) is: given n≥3 destination points find the poin...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
DOI
Add to ORKG