a b s t r a c t An iterative method is proposed for the K facilities location problem. The problem is relaxed using probabilistic assignments, depending on the distances to the facilities. The probabilities, that decompose the problem into K single-facility location problems, are updated at each iteration together with the facility locations. The proposed method is a natural generalization of the Weiszfeld method to several facilities
Location models typically use the distances to all customer locations for the assessment of the serv...
We conduct a comprehensive review on multi-level facility location problems which extend several cla...
When dealing with location problems we are usually given a set of existing facilities and we are lo...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
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 thesis is devoted towards the study and solving of a new class of multi-facility location probl...
The facility location problem is the task of optimally placing a given number of facilities in a ce...
This thesis deals with the development and implementation of efficient algorithms to obtain acceptab...
We study of a class of discrete facility location problems, called multi-level facility location pro...
The minisum location problem is well-known and has extensively been studied in the case of the unkno...
This thesis investigates the computational problem of locating obnoxious (undesirable) facilities in...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
We consider a multi-stage facility reallocation problems on the real line, where a facility is being...
Location models typically use the distances to all customer locations for the assessment of the serv...
We conduct a comprehensive review on multi-level facility location problems which extend several cla...
When dealing with location problems we are usually given a set of existing facilities and we are lo...
An iterative method is proposed for the K facilities location problem. The problem is relaxed using ...
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 thesis is devoted towards the study and solving of a new class of multi-facility location probl...
The facility location problem is the task of optimally placing a given number of facilities in a ce...
This thesis deals with the development and implementation of efficient algorithms to obtain acceptab...
We study of a class of discrete facility location problems, called multi-level facility location pro...
The minisum location problem is well-known and has extensively been studied in the case of the unkno...
This thesis investigates the computational problem of locating obnoxious (undesirable) facilities in...
AbstractIn this paper, we study the problem of facility location on a sphere. This is a generalizati...
AbstractThe single facility minisum location problem requires finding a point in RN that minimizes a...
We consider a multi-stage facility reallocation problems on the real line, where a facility is being...
Location models typically use the distances to all customer locations for the assessment of the serv...
We conduct a comprehensive review on multi-level facility location problems which extend several cla...
When dealing with location problems we are usually given a set of existing facilities and we are lo...