The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items...

The knapsack problem is one of the most studied problems in combinatorial optimization, with many real-life applications. For this reason, many special...

computer science, the continuous knapsack problem (also known as the fractional knapsack problem) is an algorithmic problem in combinatorial optimization...

multiple knapsack problem (MKP) is a generalization of both the max-sum MSSP and the knapsack problem. In this problem, there are m knapsacks and n items...

The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective...

quickly in practice. SSP is a special case of the knapsack problem and of the multiple subset sum problem. The run-time complexity of SSP depends on two...

NP-hard problem reducible to the knapsack problem. The problem can be formulated as an integer linear programming problem. A paper machine can produce an...

time O ( ( log ⁡ n ) 6 ) {\displaystyle O((\log {n})^{6})} . In the knapsack problem, we are given n {\displaystyle n} items with weight w i {\displaystyle...

maximizing the value of items that can fit in the bin is known as the knapsack problem. A variant of bin packing that occurs in practice is when items can...

optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such...

for decryption. It is based on the subset sum problem (a special case of the knapsack problem). The problem is as follows: given a set of integers A {\displaystyle...

approximation is not always exact. A related problem is the partition problem, a variant of the knapsack problem from operations research. Some weights are...

provable security. This system is based on a type of knapsack problem. Specifically, the underlying problem is this: given integers c,n,p and v0,...,vn, find...

solving an instance of the knapsack problem, which explains the term "knapsack auction". An example application of a knapsack auction is auctioning broadcast...

for many NP-complete problems, such as the knapsack problem, the traveling salesman problem, and the Boolean satisfiability problem, that can solve to optimality...

the integer knapsack problem, and has applications wider than just currency. It is also the most common variation of the coin change problem, a general...

the knapsack problem is as follows: given a set of items of varying volume and a set of knapsacks of varying capacity, assign each item to a knapsack such...

problem reduces to the multiple knapsack problem. If there is a single agent, then, this problem reduces to the knapsack problem. In the following, we have...

expressed as decision problems. Boolean satisfiability problem (SAT) Knapsack problem Hamiltonian path problem Travelling salesman problem (decision version)...

NP-complete: MP1  Some problems related to Job-shop scheduling Knapsack problem, quadratic knapsack problem, and several variants: MP9  Some problems related to Multiprocessor...

problem Close-packing of equal spheres Conway puzzle Covering problem Cutting stock problem Ellipsoid packing Kissing number problem Knapsack problem...

function continuous knapsack problem Cook reduction Cook's theorem counting sort covering CRCW Crew (algorithm) critical path problem CSP (communicating...

1  The knapsack problem, as well as some of its variants: 0-1 knapsack problem. Unbounded knapsack problem. Multi-dimensional knapsack problem with Delta-modular...

partition problem (WCGTPP) Arc-weighted l-cardinality tree problem (AWlCTP) Multiple knapsack problem (MKP) Maximum independent set problem (MIS) Ant...

NP-hard knapsack problem can be solved by a dynamic programming algorithm requiring a number of steps polynomial in the size of the knapsack and the number...

NP-hardness of this unary version of the problem. For example, bin packing is strongly NP-complete while the 0-1 Knapsack problem is only weakly NP-complete. Thus...

most convenient technique for parsing, for the knapsack problem and other combinatorial optimization problems. It is also the program execution strategy used...

Rhine-Westphalia the knapsack problem, a math problem the subset sum problem, a special case of the above Naccache-Stern knapsack cryptosystem, a cryptosystem...

The Monty Hall problem is a brain teaser, in the form of a probability puzzle, based nominally on the American television game show Let's Make a Deal...

value for many hard problems. For example, the Knapsack problem, where there is a set of items, and the goal is to pack the knapsack to get the maximum...