Buscar
Mostrando ítems 401-410 de 504
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Set-valued TU-games
(Elsevier, 2004)
The goal of this paper is to explore solution concepts for set-valued TU-games. Several stability conditions can be defined since one can have various interpretations of an improvement within the multicriteria framework. ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Mathematical programming formulations for the efficient solution of the k-sum approval voting problem
(Elsevier, 2018-10)
In this paper we address the problem of electing a committee among a set of m candidates and on the basis of the preferences of a set of n voters. We consider the approval voting method in which each voter can approve as ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Finding the nucleolus of any n-person cooperative game by a single linear program
(Elsevier, 2013-10)
In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with O(4n) constraints whose coeffi- cients belong to {−1, 0, 1}. We discuss the need of having all these ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Método de exploración secuencial cuasi equilibrado en muestreo en poblaciones finitas
(Instituto Nacional de Estadística, 1994)
En este trabajo se propone un procedimiento de muestreo de tipo secuencial que proporciona probabilidades de inclusión de primer orden proporcionales al tamaño, sobre bloques de la población, siendo las de segundo orden ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Diseños muestrales pi-equivalentes y equivalentes de primer orden
(Universidad Politécnica de Cataluña, 1996)
El comportamiento de un diseño muestral en relación al estimador de Horvitz-Thompson depende exclusivamente de sus probabilidades de inclusión de primer y segundo orden. Al ser, usualmente, mucho mayor el número de muestras ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Optimal location and design of a competitive facility
(Springer, 2004-06)
A single facility has to be located in competition with fixed existing facilities of similar type. Demand is supposed to be concentrated at a finite number of points, and consumers patronise the facility to which they are ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Quasilinear approximation for interval-valued functions via generalized Hukuhara differentiability
(Springer, 2022-04-20)
In this paper, a new generalized Hukuhara differentiability concept for interval-valued functions defined on Rn is proposed, which extends the classical Fréchet differentiability notion and provides an interval quasilinear ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A heuristic method for simultaneous tower and pattern-free field optimization on solar power systems
(Elsevier, 2015-05)
A heuristic method for optimizing a solar power tower system is proposed, in which both heliostat field (heliostat locations and number) and the tower (tower height and receiver size) are simultaneously considered. Maximizing ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Automatic Eligibility of Sellers in an Online Marketplace: A Case Study of Amazon Algorithm
(MDPI, 2022-01-19)
Purchase processes on Amazon Marketplace begin at the Buy Box, which represents the buy click process through which numerous sellers compete. This study aimed to estimate empirically the relevant seller characteristics ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
New heuristic for harmonic means clustering
(Springer, 2014-05-06)
It is well known that some local search heuristics for K-clustering problems, such as k-means heuristic for minimum sum-of-squares clustering occasionally stop at a solution with a smaller number of clusters than the ...