Minimizing the average arriving distance in carpooling
نویسندگان
چکیده
منابع مشابه
Minimizing the average distance to a closest leaf in a phylogenetic tree
When performing an analysis on a collection of molecular sequences, it can be convenient to reduce the number of sequences under consideration while maintaining some characteristic of a larger collection of sequences. For example, one may wish to select a subset of high-quality sequences that represent the diversity of a larger collection of sequences. One may also wish to specialize a large da...
متن کاملRanking efficient DMUs using minimizing distance in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The main purpose of this paper ...
متن کاملChoosing subsamples for sequencing studies by 1 minimizing the average distance to the closest leaf
19 Imputation of genotypes in a study sample can make use of sequenced or densely genotyped 20 external reference panels consisting of individuals that are not from the study sample. It can 21 also employ internal reference panels, incorporating a subset of individuals from the study 22 sample itself. Internal panels offer an advantage over external panels, as they can reduce 23 imputation erro...
متن کاملChoosing Subsamples for Sequencing Studies by Minimizing the Average Distance to the Closest Leaf
Imputation of genotypes in a study sample can make use of sequenced or densely genotyped external reference panels consisting of individuals that are not from the study sample. It also can employ internal reference panels, incorporating a subset of individuals from the study sample itself. Internal panels offer an advantage over external panels because they can reduce imputation errors arising ...
متن کاملInteger Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town?
An n-town, n ∈ N, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid, then an n-town has optimal shape if the sum of all pairwise Manhattan distances is minimized. This problem has been studied for cities, i.e., the limiting case of very large n. For cities, it is kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2020
ISSN: 1550-1477,1550-1477
DOI: 10.1177/1550147719899369