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,...

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...

We will discuss knapsack problems that arise in certain computa− tional number theory settings. A common theme is that the search space for the standard real relaxation is large; in a sense this trans− lates to a poor choice of variables. Lattice reduction methods have been developed in the past few years to improve handling of such problems. We show explicitly how they may be applied to comput...

There is one multi agent class that can be viewed as a society where the normative system guides the agents to achieve the system goals. When an agent perceives a normative system, it needs to reason about the norms impact on its desires. Considering that the agent’s resources are limited, it is necessary to reason about the resources available and if they are enough to achieve a desire or norm...

Election is a fundamental mechanism of democracy for people to elect a Government of their choice. Electronic voting is an emerging technology that guarantees privacy, security, correctness, verifiability and robustness. Recently, many researchers have proposed the improvements of efficient schemes on the electronic voting to ensure the security and privacy of voters. However, there is no schem...

Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query range to achieve certain global optimality while avoid congesting the sensors in the meanwhile. We study this problem for a ZigBee cluster tree by formulating it into a multi-dimensional multi-choice knapsack problem. ...

In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose an algorithm which is based upon reactive local search and where an explicit check for the repetition of configurations is added to the local search. The algorithm starts by an initial solution and improved by using a fast iterative procedure. Later, both deblocking and degrading procedures ...

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...