Add to ORKGWe consider the single facility ordered median location problem with uncertainty in the parameters (weights) defining the objective function. We study two cases. In the first case the uncertain weights belong to a region with a finite number of extreme points, and in the second case they must also satisfy some order constraints and belong to some box, (convex case). To deal with the uncertainty we apply the minimax regret approach, providing strongly polynomial time algorithms to solve these problems
We consider the minmax regret 1-center problem on a general network with uncertainty on demands. Unl...
In the last decade, several robustness approaches have been developed to deal with uncertainty. In d...
One of the main challenges in the area of discrete optimization is to find efficient and effective w...
AbstractWe consider single facility location problems (1-median and weighted 1-center) on a plane wi...
We consider a family of 1-median location problems on a tree network where the vertex weights are ra...
AbstractWe consider single facility location problems (1-median and weighted 1-center) on a plane wi...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
This paper investigatesthe classical $p$-median location problem in a network in which some of the...
In this paper we study facility location problems on graphs under the most common criteria, such as,...
viii, 82 p. : ill. ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577P LMS 2009 TangOne of the most im...
We address the following single-facility location problem: a firm is entering into a market by locat...
In this paper we introduce a new objective function for the minimax location problem. Every demand p...
Classical location models fix an objective function and then attempt to find optimal points to this ...
AbstractThis paper deals with the problem of locating path-shaped facilities of unrestricted length ...
We consider the minmax regret 1-center problem on a general network with un-certainty on demands. Un...
We consider the minmax regret 1-center problem on a general network with uncertainty on demands. Unl...
In the last decade, several robustness approaches have been developed to deal with uncertainty. In d...
One of the main challenges in the area of discrete optimization is to find efficient and effective w...
AbstractWe consider single facility location problems (1-median and weighted 1-center) on a plane wi...
We consider a family of 1-median location problems on a tree network where the vertex weights are ra...
AbstractWe consider single facility location problems (1-median and weighted 1-center) on a plane wi...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
This paper investigatesthe classical $p$-median location problem in a network in which some of the...
In this paper we study facility location problems on graphs under the most common criteria, such as,...
viii, 82 p. : ill. ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577P LMS 2009 TangOne of the most im...
We address the following single-facility location problem: a firm is entering into a market by locat...
In this paper we introduce a new objective function for the minimax location problem. Every demand p...
Classical location models fix an objective function and then attempt to find optimal points to this ...
AbstractThis paper deals with the problem of locating path-shaped facilities of unrestricted length ...
We consider the minmax regret 1-center problem on a general network with un-certainty on demands. Un...
We consider the minmax regret 1-center problem on a general network with uncertainty on demands. Unl...
In the last decade, several robustness approaches have been developed to deal with uncertainty. In d...
One of the main challenges in the area of discrete optimization is to find efficient and effective w...