Buscar
Mostrando ítems 31-40 de 103
Artículo
Unreliable point facility location problems on networks
(Elsevier, 2014-03)
In this paper we study facility location problems on graphs under the most common criteria, such as, median, center and centdian, but we incorporate in the objective function some reliability aspects. Assuming that facilities ...
Artículo
Center location problems on tree graphs with subtree-shaped customers
(Elsevier, 2008-08-06)
We consider the p-center problem on tree graphs where the customers are modeled as continua subtrees. We address unweighted and weighted models as well as distances with and without addends. We prove that a relatively ...
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
The use of relative priorities in optimizing the performance of a queueing system
(Elsevier, 2009)
Relative priorities in an n-class queueing system can reduce server and customer costs. This property is demonstrated in a single server Markovian model where the goal is to minimize a non-linear cost function of class ...
Artículo
Análisis interactivo de las soluciones del problema lineal múltiple ordenado
(Universidad Politécnica de Cataluña, 1994)
Artículo
Solution concepts for multiple objective N-person games
(Associação Portuguesa de Investigação Operacional, 1999-12)
Artículo
Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
(Elsevier, 2017-11-01)
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some ...
Tesis Doctoral
Juegos con pagos difusos
(2009)
Artículo
The multiscenario lot size problem with concave costs
(Elsevier, 2004)
The dynamic single-facility single-item lot size problem is addressed. The finite planning horizon is divided into several time periods. Although the total demand is assumed to be a fixed value, the distribution of this ...
Artículo
Two-phase strategies for the bi-objective minimum spanning tree problem
(Wiley, 2022-01-12)
This paper presents a new two-phase algorithm for the bi-objective minimum spanning tree (BMST) prob-lem. In the first phase, it computes the extreme supported efficient solutions resorting to both mathematicalprogramming ...