AbstractWe develop a generalized bounding method for the Weiszfeld iterative procedure used to solve the hyperbolically approximated ℓp-norm single- and multifacility minimum location problems. We also show that, at optimality, the solution to the bound problem coincides with the solution to the original location problem. We use this result to show that the rectangular bound value converges to the single-facility location problem optimal objective function value
a b s t r a c t An iterative method is proposed for the K facilities location problem. The problem i...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
This paper studies the problem of deciding whether the present iteration point of some algorithm app...
AbstractWe develop a generalized bounding method for the Weiszfeld iterative procedure used to solve...
AbstractWe investigate the convergence properties of the Weiszfeld procedure when it is applied to t...
This paper addresses the general continuous single facility location problems in finite dimension s...
In this survey, we examine an important class of facility location problems known as the multisource...
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
This paper presents a new local search approach for solving continuous location problems. The main i...
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
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...
Abstract. The Weiszfeld algorithm for continuous location problems can be considered as an iterative...
a b s t r a c t An iterative method is proposed for the K facilities location problem. The problem i...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
This paper studies the problem of deciding whether the present iteration point of some algorithm app...
AbstractWe develop a generalized bounding method for the Weiszfeld iterative procedure used to solve...
AbstractWe investigate the convergence properties of the Weiszfeld procedure when it is applied to t...
This paper addresses the general continuous single facility location problems in finite dimension s...
In this survey, we examine an important class of facility location problems known as the multisource...
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
This paper presents a new local search approach for solving continuous location problems. The main i...
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
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...
Abstract. The Weiszfeld algorithm for continuous location problems can be considered as an iterative...
a b s t r a c t An iterative method is proposed for the K facilities location problem. The problem i...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
This paper studies the problem of deciding whether the present iteration point of some algorithm app...