نتایج جستجو برای: dimesional knapsack
تعداد نتایج: 3034 فیلتر نتایج به سال:
Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly. The KPPI naturally bridges the gap and elucidates the relation between the pspace-hard restless bandit problem and the np-hard knapsack problem. Our main result is a problem decomposition method resu...
Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly. The KPPI naturally bridges the gap and elucidates the relation between the pspace-hard restless bandit problem and the np-hard knapsack problem. Our main result is a problem decomposition method resu...
A new repair method based on QEA for 0/1 knapsack problems is proposed. In this approach, the qubit chromosome is used as heuristic knowledge to evaluate each element for the knapsack. The main idea is to delete the knapsack elements in the ascending order of qubit chromosome’s probability value whilst avoid violating the constraints on its capacity. To minimize the influence of initialization,...
In this paper, we study the online unweighted knapsack problem with removal cost. The input is a sequence of items u1, u2, . . . , un, each of which has a size and a value, where the value of each item is assumed to be equal to the size. Given the ith item ui, we either put ui into the knapsack or reject it with no cost. When ui is put into the knapsack, some items in the knapsack are removed w...
During the last decades, much research has been conducted on deriving classes of valid inequalities for mixed integer knapsack sets, which we call knapsack cuts. Bixby et al. (The sharpest cut: the impact of Manfred Padberg and his work. MPS/SIAM Series on Optimization, pp. 309–326, 2004) empirically observe that, within the context of branch-and-cut algorithms to solve mixed integer programmin...
0/1 Multiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem. 0/1 Multiple Knapsack Problem has many applications in disciplines related to computer science and operations research. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve diffi...
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimentally investigate the number of Pareto optimal knapsack fillings. Our experiments suggests that the theoretically proven upper bound of O(n3) for uniform instances and O(φμn4) for general probability distributions is no...
A dynamic knapsack set is a natural generalization of the 0-1 knapsack set with a continuous variable studied recently. For dynamic knapsack sets a large family of facet-defining inequalities, called dynamic knapsack inequalities, are derived by fixing variables to one and then lifting. Surprisingly such inequalities have the simultaneous lifting property, and for small instances provide a sign...
Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems. Therefore, it is valuable to develop effective and efficient algorithms for solving 0-1 knapsack problems. Aiming at the drawbacks of the selection operator in the traditional differential evolution (DE), we present a novel discrete diffe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید