Buscar
Mostrando ítems 1-6 de 6
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
Exact procedures for solving the discrete ordered median problem
(Elsevier, 2006-11)
The Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as the N-median, N-center and Uncapacitated Facility Location problems. It was introduced by Nickel [S. Nickel. Discrete ...
Artículo
A unified approach to network location problems
(John Wiley and Sons, 1999)
In this paper we introduce a new type of single facility location problems on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set ...
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 flexible approach to location problems
(Springer, 2000-02)
When dealing with location problems we are usually given a set of existing facilities and we are looking for the location of one or several new facilities. In the classical approaches weights are assigned to existing ...
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 ...