We propose a pseudo-market solution to resource allocation problems subject constraints. Our treatment of constraints is general: including bihierarchical due considerations diversity in school choice, or scheduling course allocation; and other forms needed model, for example, the market roommates, combinatorial assignment problems, knapsack Constraints give rise pecuniary externalities, which ...

The widening gap between processors and memory necessitates the development of novel memory hierarchies: hierarchies that can possibly service memory references at register speeds, since service at cache speeds may not be adequate. We consider the design of a novel memory hierarchy component, a knapsack, whose purpose is to provide (very) fast access to frequently-used data objects. Software al...

In the classical deterministic knapsack problem, a knapsack of capacity C is given, together with K classes of objects. For every k = 1, . . . ,K, each object of the class k has a size bk and an associated reward rk. The objects can be placed into the knapsack as long as the sum of their sizes does not exceed the capacity C. The problem consists in placing the objects inside the knapsack so as ...

One of the combinatorial optimization problems is Knapsack problem, which aims to maximize benefit objects whose weight not exceeding capacity knapsack. This paper introduces artificial bee colony algorithm select a subset project and represented by knapsack problem put best investment plan achieve highest profits within determined costs, this one applications financial field. The result from p...

2 Knapsack Problem (continued) 2.1 Algorithm Recap Definition: We define states (sub-problems) as the following: the maximum value for a knapsack with capacity j and we are given the first i items. Then, we have ∀i, j, the corresponding state, a[i, j] is max(a[i−1, j−wi] + vi, a[i−1, j]), where the first option is the value if item i is in the knapsack and the second option is the value if item...

The 0/1 knapsack problem is a well known problem occurring in many real world problems. The problem is NP-Complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a ε-dominance relation fo...

It is well known that the knapsack cryptosystem is a type of public key cryptosystems. It is based on the well known mathematical concept, i.e., the choosing of one way function. Many Knapsack cryptosystems were invented in the last 20 years, and many attacking methods were invented as a counterattack against the developed knapsack cryptosystems. All the attacking methods aim towards breaking t...

Ralph Gomory has recently aroused interest in a special type of knapsack problem in which the constraint coefficients and constant term are elements of a finite additive group. The significance of this problem lies in the fact that it is closely related to the general integer linear programming problem, resulting by removing the nonnegativity restrictions on those variables in the general probl...