نتایج جستجو برای: multiple choice knapsack
تعداد نتایج: 935949 فیلتر نتایج به سال:
The online knapsack problem is a classic resource allocation in networking and operations research. Its basic version studies how to pack arriving items of different sizes values into capacity-limited knapsack. In this paper, we study general that includes item departures, while also considering multiple knapsacks multi-dimensional sizes. We design threshold-based algorithm prove the can achiev...
A standard correction for random guessing (cfg) formula on multiple-choice and Yes/Noexaminations was examined retrospectively in the scores of the intermediate female EFL learners in an English language school. The correctionwas a weighting formula for points awarded for correct answers,incorrect answers, and unanswered questions so that the expectedvalue of the increase in test score due to g...
The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows. A cutting plane algorithm is derived using a superadditive approach. The inequalities considered here a...
The multidimensional O-l knapsack problem, defined as a knapsack with multiple resource constraints, is well known to be much more difficult than the single constraint version. This paper deals with the design of an efficient preprocessing procedure for large-scale instances. The algorithm provides sharp lower and upper bounds on the optimal value, and also a tighter equivalent representation b...
Four-layer framework for combinatorial optimization problems/models domain is suggested for applied problems structuring and solving: (1) basic combinatorial models and multicriteria decision making problems (e.g., clustering, knapsack problem, multiple choice problem, multicriteria ranking, assignment/allocation); (2) composite models/procedures (e.g., multicriteria combinatorial problems, mor...
The stochastic knapsack problem is a natural generalization of classical knapsack problem. In this problem, we are given a set of items each associated with a probability distribution on sizes and a profit, and a knapsack of unit capacity. The size of an item is unknown before inserting it into the knapsack, and it is revealed as soon as the item inserted into the knapsack. The objective is to ...
We introduce a formal structure for dynamic programming that associates a unique dynamic programming functional equation to every deterministic, separable decision tree representation of the underlying problem. Since, in general, the computational complexity of the resulting functional equation depends on the decision tree chosen, the art of dynamic programming is shown to lie in the choice of ...
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product. On the other hand, the class of knapsack-semilinear groups, where solutions sets of knapsack equations are effectively semilinear, is closed under...
We present the documentation and mathematical modeling of open-box system RaPID/?. The software is designed for choice classrooms assignment proctoring duties in massive tests, which a common situation educational institutions offering large coordinated lower division courses. model binary integer programming problem: combination 0-1 knapsack problem job-assignment problem. makes decisions acco...
Problem Definition This problem deals with packing a maximum reward set of items into a knapsack of given capacity, when the item-sizes are random. The input is a collection of n items, where each item i ∈ [n] := {1, · · · , n} has reward r i ≥ 0 and size S i ≥ 0, and a knapsack capacity B ≥ 0. In the stochastic knapsack problem, all rewards are deterministic but the sizes are random. The rando...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید