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
Solving nonconvex planar location problems by nite dominating sets
(Springer, 2000-10)
It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by nding a fi nite dominating set, i.e. a finite set of candidates guaranteed to contain at least one ...
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
Robust facility location
(Springer, 2003-11)
Let A be a nonempty finite subset of the plane representing the geographical coordinates of a set of demand points (towns, …), to be served by a facility, whose location within a given region S is sought. Assuming that the ...
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 ...