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
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
textabstractIn this paper, a class of min-max continuous location problems is discussed. After givin...
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective...
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...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocatio
When dealing with location problems we are usually given a set of existing facilities and we are lo...
Abstract. In this paper, a class of min-max continuous location prob-lems is discussed. After giving...
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
In this survey, we examine an important class of facility location problems known as the multisource...
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...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
textabstractIn this paper, a class of min-max continuous location problems is discussed. After givin...
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective...
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...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
On the convergence of the Weiszfeld algorithm for continuous single facility location-allocatio
When dealing with location problems we are usually given a set of existing facilities and we are lo...
Abstract. In this paper, a class of min-max continuous location prob-lems is discussed. After giving...
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
In this survey, we examine an important class of facility location problems known as the multisource...
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...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
textabstractIn this paper, a class of min-max continuous location problems is discussed. After givin...
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective...