Buscar
Mostrando ítems 1-9 de 9
Artículo
Dynamic programming analysis of the tv game Who Wants to Be a Millionaire?
(Elsevier, 2009)
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionaire?’. It obtains the optimal strategies to ...
Tesis Doctoral
Soluciones algebraicas a la resolución de problemas multiobjetivo discretos Algebraic solutions for solving discrete multiobjective problems
(2009)
Esta tesis doctoral estudia algunos de los aspectos algebraicos de la optimización multiobjetivo lineal y polinomial. Primeramente, en el Capítulo 1 se introducen los conceptos básicos necesarios para el desarrollo de los ...
Artículo
The multi-period incremental service facility location problem
(Elsevier, 2009)
In this paper we introduce the multi-period incremental service facility location problem where the goal is to set a number of new facilities over a finite time horizon so as to cover dynamically the demand of a given set ...
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 ...
Tesis Doctoral
Juegos con pagos difusos
(2009)
Artículo
The continuous and discrete path variance problem on trees
(Wiley, 2009-03)
In this paper we consider the problem of locating path-shaped facilities on a tree minimizing the variance objective function. This kind of objective function is generally adopted in location problems which arise in the ...
Artículo
Production-inventory games: A new class of totally balanced combinatorial optimization games
(Elsevier, 2009)
In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its ...
Artículo
A flexible model and efficient solution strategies for discrete location problems
(Elsevier, 2009-03-06)
Flexible discrete location problems are a generalization of most classical discrete locations problems like p-median or p-center problems. They can be modeled by using so-called ordered median functions. These functions ...
Artículo