منابع مشابه
Finding the most efficient decision making unit in data envelopment Analysis
Although discriminating between all efficient decision making units (DMUs) with identical efficiency is a very important subject in data envelopment analysis (DEA), it may not be an easy task, particularly when the decision maker wants to select one and only one efficient DMU among all. There are some papers that have proposed methods for finding an efficient DMU as the most efficient one but h...
متن کاملEfficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem
We study in this paper the problem of finding in a graph a subset of k edges whose deletion causes the largest increase in the weight of a minimum spanning tree. We propose for this problem an explicit enumeration algorithm whose complexity, when compared to the current best algorithm, is better for general k but very slightly worse for fixed k. More interestingly, unlike in the previous algori...
متن کاملFinding the Most Relevant Fragments in Networks
We study a point pattern detection problem on networks, motivated by applications in geographical analysis, such as crime hotspot detection. Given a network N (a connected graph with non-negative edge lengths) together with a set of sites, which lie on the edges or vertices of N , we look for a connected subnetwork F of N of small total length that contains many sites. The edges of F can form p...
متن کاملa new dea model for finding most efficient dmu with imprecise data
data envelopment analysis (dea) is a widely recognized approach for evaluating the efficiencies of decision making units (dmus). because of easy and successful application and case studies, dea has gained much attention and widespread use by business and academy researchers. the conventional dea models (e.g. bcc and ccr) make an assumption that input and output data are exact values on a ratio ...
متن کاملThe Complexity of Finding Most Vital
Let G(V; E) be a graph (either directed or undirected) with a non-negative length`(e) associated with each arc e in E. For two speciied nodes s and t in V , the k most vital arcs (or nodes) are those k arcs (nodes) whose removal maximizes the increase in the length of the shortest path from s to t. We prove that nding the k most vital arcs (or nodes) is NP-hard, even when all arcs have unit len...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Energy
سال: 2018
ISSN: 2058-7546
DOI: 10.1038/s41560-018-0139-7