نتایج جستجو برای: multiple choice knapsack
تعداد نتایج: 935949 فیلتر نتایج به سال:
test method facet is one of the factors which can have an influence on the test takers’ performance. the purpose of the current study was to investigate the effects of two different response types, multiple-choice cloze and multiple-choice test, on the pre-intermediate and intermediate test takers’ reading comprehension performance. to this end, 40 pre-intermediate and intermediate learners par...
We consider the minimization version of the multi-dimensional knapsack problem with bounded integer variables. We propose a greedy approximation algorithm that runs in O(mn) time and has a guarantee of m + 1, where n is the number of items and m is the number of knapsack constraints. The guarantee of the algorithm can be improved in case of easy coefficients in the constraints associated with s...
the major aim of this study was to investigate the relationship between iq, eq and test format in the light of test fairness considerations. this study took this relationship into account to see if people with different eq and iq performed differently on different test formats. to this end, 90 advanced learners of english form college of ferdowsi university of mashhad were chosen. they were ask...
We examine a situation in which a decision-maker executes a sequence of resource allocation decisions over time, but the availability of the indivisible resources at future epochs is uncertain due to actions of competitors. We cast this problem as a specialized type of stochastic knapsack problem in which the uncertainty of item (resource) availability is induced by competitors concurrently fil...
RÉSUMÉ : We consider two variants of knapsack problems with setups arising as subproblems in a DantzigWolfe decomposition approach to more complex combinatorial optimization problems. In the multiple-class binary knapsack problem with setups, items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item weights are assumed to be a multiple of their ...
After the seminal books by Martello and Toth (1990) Kellerer, Pferschy, Pisinger (2004), knapsack problems became a classical rich research area in combinatorial optimization. The purpose of this survey, which is structured two parts, to cover developments that appeared field after publication latter volume. Part I devoted whose goal optimally assign items single knapsack. Besides (binary, subs...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید