Add to ORKGOn the convergence of the Weiszfeld algorithm for continuous single facility location-allocatio
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
This thesis focuses on the family of the continuous location problems. A location problem arises wh...
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...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
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...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in ...
This paper addresses the general continuous single facility location problems in finite dimension s...
A new and simple methodology is proposed to solve both constrained and unconstrained planar continu...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
This thesis focuses on the family of the continuous location problems. A location problem arises wh...
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...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
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...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in ...
This paper addresses the general continuous single facility location problems in finite dimension s...
A new and simple methodology is proposed to solve both constrained and unconstrained planar continu...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
This thesis focuses on the family of the continuous location problems. A location problem arises wh...