Search
Now showing items 1-10 of 104
Article
On Covering Methods for D.C. Optimization
(Springer, 2000-11-01)
Covering methods constitute a broad class of algorithms for solving multivariate Global Optimization problems. In this note we show that, when the objective f is d.c. and a d.c. decomposition for f is known, the computational ...
Article
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 ...
Article
Edición de encuestas mediante redes de neuronas artificiales
(Universidad de Salamanca, 2001)
Se presenta un procedimiento de imputación de valores perdidos y un método para la detección y corrección de inconsistencias en las respuestas recogidas como resultado de una encuesta estadística. Para ello se describe el ...
Article
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 ...
Article
El papel de la ansiedad matemática en el paso de la educación secundaria a la educación universitaria
(Universidad de Granada, 2009-09)
Las respuestas afectivas juegan un papel esencial en el proceso de enseñanza y aprendizaje de las matemáticas. Gran número de investigaciones se ha centrado en la ansiedad matemática y la han relacionado con diferencias ...
Article
Article
A biobjective method for sample allocation in stratified sampling
(Elsevier, 2007-03-01)
The two main and contradicting criteria guiding sampling design are accuracy of estimators and sampling costs. In stratified random sampling, the sample size must be allocated to strata in order to optimize both objectives. ...
Article
A DC biobjective location model
(Springer, 2002)
In this paper we address the biobjective problem of locating a semiobnoxious facility, that must provide service to a given set of demand points and, at the same time, has some negative effect on given regions in the ...
Article
Two-group classification via a biobjective margin maximization model
(ELSEVIER SCIENCE BV, 2006-09-16)
In this paper we propose a biobjective model for two-group classification via margin maximization, in which the margins in both classes are simultaneously maximized. The set of Pareto-optimal solutions is described, yielding ...
Article
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 ...