نتایج جستجو برای: allocation problem
تعداد نتایج: 943811 فیلتر نتایج به سال:
In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resource allocation problem and with respect to its practical use for multicast address assignment. We define a framework for the problem, introduce complexity results, and formulate several new allocation algorithms. Despite the theor...
A large number of heuristic search algorithms are available for function optimization. Each of these heuristics, e.g., simulated annealing, genetic algorithms, tabu search, etc., has been shown to be effective at finding good solutions efficiently. However, little work has been directed at determining what are the important problem characteristics for which one algorithm is more efficient than ...
Recently the concept of facility efficiency, which defined by data envelopment analysis (DEA), introduced as a location modeling objective, that provides facilities location’s effect on their performance in serving demands. By combining the DEA models with the location problem, two types of “efficiencies” are optimized: spatial efficiency which measured by finding the least cost location and al...
In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید