Buscar
Mostrando ítems 1-3 de 3
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 ...
Artículo
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs
(Wiley, 2008)
This paper deals with the following graph partitioning problem. Consider a connected graph with n nodes, p of which are centers, while the remaining ones are units. For each unit-center pair there is a fixed service cost ...
Artículo
Multiobjective solution of the uncapacitated plant location problem
(Elsevier, 2003)
In this paper we consider the discrete multiobjective uncapacitated plant location problem. We present an exact and an approximate approach to obtain the set of non-dominated solutions. The two approaches resort to dynamic ...