نتایج جستجو برای: multiple choice knapsack
تعداد نتایج: 935949 فیلتر نتایج به سال:
Efficient Algorithms with Performance Guarantees for the Stochastic Multiple-Choice Knapsack Problem
We study the stochastic multiple-choice knapsack problem, where a set of K items, whose value and weight are random variables, arrive to the system at each time step, and a decision maker has to choose at most one item to put into the knapsack without exceeding its capacity. The goal of the decision-maker is to maximise the total expected value of chosen items with respect to the knapsack capac...
The Tree Knapsack Problem (TKP) is a 0–1 integer programming problem where hierarchy constraints are enforced. If a node is selected for packing into the knapsack, all the ancestor nodes on the path from the root to the selected node are packed as well. One apparent application of this problem is the simplification of computer graphics models. Real applications also use alternative representati...
Combinatorial evolution and forecasting of system requirements is examined. The morphological model is used for a hierarchical requirements system (i.e., system parts, design alternatives for the system parts, ordinal estimates for the alternatives). A set of system changes involves changes of the system structure, component alternatives and their estimates. The composition process of the forec...
Multiple-choice knapsack problem (MCKP) is a well-known NP-hard problem and it has a lot of applications in the real-world and theory. In this study, the Artificial chemical reaction optimization algorithm (ACROA) that uses integer string code is developed to solve MCKP. Four specific reaction operators are designed to implicate local and global search. A new penalty function that aims to force...
With the fast development of wireless sensor network (WSN) technologies, WSNs have widely shifted from a specialized platform for a single application to an integrated infrastructure supporting multiple applications. It is hence a critical problem to allocate multiple applications to multiple sensors in order to maximize user utility subject to various resource constraints. The resulting constr...
The quadratic multiple knapsack problem (QMKP) is a generalization of the quadratic knapsack problem from a single knapsack to k knapsacks. In this study, the mathematical model of the QMKP is generalized as covering the constraints that we may face in real life problems. A new hybrid algorithm which combines F-MSG algorithm and genetic algorithm is proposed to solve the Generalized QMKP (GQMKP...
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and propose a new algorithm to solve SMCKP and the corresponding bidding optimization problem. Our algorithm selects items online based on a threshold function which can be built/updated using historical data. Our algorithm achieved about 99% performance compared to...
reading comprehension ability consists of multiple cognitive processes, and cloze tests have long been claimed to measure this ability as a whole. however, since the introduction of cloze test, different varieties of it have been proposed by the testers. thus, the present study was an attempt to examine the relatedness of cloze-elide test, multiple-choice (mc) cloze test, and c-test as three di...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید