Buscar
Mostrando ítems 91-100 de 104
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
Linear prediction of weak records: the discrete case
(Society for Industrial and Applied Mathematics, 2004)
We characterize the family of discrete distributions for which the best mean square error predictor of a future weak record is a linear function of a past or observed weak record.
Artículo
An Exact Method for Fractional Goal Programming
(Springer, 2004-01-04)
Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus optimal solutions can be obtained by using existing Global ...
Artículo
Finding GM-estimators with global optimization techniques
(Springer, 2001-01-01)
In this note we address the problem of finding the GM-estimator for the location parameter of a univariate random variable. When this problem is non-convex but d.c. one can use a standard covering method, which, in the ...
Artículo
A comparison of formulations and solution methods for the minimum-envy location problem. Additional results
(2008)
We consider a discrete facility location problem with a new form of equity criterion. The model discussed in the paper analyzes the case where demand points only have strict preference order on the sites where the plants ...
Artículo
e-Encuestas Probabilísticas I. Los Marcos
(Instituto Nacional de Estadística, 2002)
Se formalizan los conceptos que surgen al plantear la realización de encuestas entre los usuarios de Internet. Para ello se define el concepto de e-encuesta probabilística, que extiende la definición de encuesta probabilística ...
Artículo
An optimal bound for d.c. programs with convex constraints
(Springer, 2001-04-01)
A well-known strategy for obtaining a lower bound on the minimum of a d.c. function f−g over a compact convex set S⊂ℝn consists of replacing the convex function f by a linear minorant at x 0∈S. In this note we show that ...
Artículo
Artículo
Locating Objects in the Plane Using Global Optimization Techniques
(Informs, 2009-10-07)
We address the problem of locating objects in the plane such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundaries. Given a set of points, we seek the rotation and translation ...
Artículo
Inferring efficient weights from pairwise comparison matrices
(Springer, 2006-10)
Several multi-criteria-decision-making methodologies assume the existence of weights associated with the different criteria, reflecting their relative importance.One of the most popular ways to infer such weights is the ...