Buscar
Mostrando ítems 1-7 de 7
Artículo
On the exponential cardinality of FDS for the ordered p-median problem
(Elsevier, 2005)
We study finite dominating sets (FDS) for the ordered median problem. This kind of problems allows to deal simultaneously with a large number of models. We show that there is no valid polynomial size FDS for the general ...
Artículo
New results on minimax regret single facility ordered median location problems on networks
(Springer, 2007)
We 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 ...
Capítulo de Libro
Location problems with multiple criteria
(Springer, 2015)
This chapter analyzes multicriteria continuous, network, and discrete location problems. In the continuous framework, we provide a complete description of the set of weak Pareto, Pareto, and strict Pareto locations for a ...
Artículo
A generalized model of equality measures in network location problems
(Elsevier, 2008-03)
In this paper, the concept of the ordered weighted averaging operator is applied to define a model which unifies and generalizes several inequality measures. For a location x, the value of the new objective function is the ...
Artículo
Routing for unmanned aerial vehicles: Touring dimensional sets
(Elsevier, 2021-07-09)
In this paper we deal with an extension of the crossing postman problem to design routes that have to visit different shapes of dimensional elements rather than edges. This problem models the design of routes of drones or ...
Artículo
Solving multifacility Huff location models on networks using metaheuristic and exact approaches
(PERGAMON-ELSEVIER SCIENCE LTD, 2016-03-16)
In this paper we consider multifacility Huff facility location problem on networks. First, we introduce a slight modification of the existing mixed integer nonlinear mathematical model and confirm its validity by using the ...
Artículo
Sum-of-squares clustering on networks
(University of Belgrade, 2011)
Finding p prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a well-studied problem in clustering, data analysis and continuous location. In this note, this very ...