Buscar
Mostrando ítems 11-15 de 15
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Averaging the k largest distances among n: k-centra in Banach spaces
(Elsevier, 2004-03-15)
Given a Banach space X let A ⊂ X containing at least k points. In location theory, reliability analysis, and theoretical computer science, it is useful to minimize the sum of distances from the k furthest points of A: this ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
The bi-criteria doubly weighted center-median path problem on a tree
(Wiley, 2006-07)
Given a tree network T with n nodes, let PL be the subset of all discrete paths whose length is bounded above by a prespecified value L. We consider the location of a path-shaped facility P ∈ PL, where customers are represented ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Multi-group support vector machines with measurement costs a biobjective approach
(Elsevier, 2008-03)
Support Vector Machine has shown to have good performance in many practical classification settings. In this paper we propose, for multi-group classification, a biobjective optimization model in which we consider not only ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
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 ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Máquinas de vector de apoyo: problemas de programación matemática en clasificación
(Sociedad de Estadística e Investigación Operativa, 2005-06)