Search results

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

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

capacity, we can have multiple subset sum problem. Quadratic knapsack problem: Set-Union Knapsack Problem: SUKP is defined by Kellerer et al (on page...

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

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

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

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

Delta-modular constraints. Multi-objective 0-1 knapsack problem. Parametric knapsack problem. Symmetric quadratic knapsack problem. Count-subset-sum (#SubsetSum)...

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

Similarly, algorithms can solve the NP-complete knapsack problem over a wide range of sizes in less than quadratic time and SAT solvers routinely handle large...

Tanja (2019-07-29). "Knapsack Voting for Participatory Budgeting". ACM Transactions on Economics and Computation. 7 (2): 8:1–8:27. arXiv:2009.06856...

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

0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 ]  and  [ 0 0 1 1 0 0 1 1 1 1 0 0 1 1 0 0 ]  and  [ 1 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 ]  and  [ 1 0 0 1 0 1 1 0 0 1 1 0...

individual knapsack problem - finding the subset which maximizes their personal utility under the budget constraint. An advantage of knapsack voting is...

overview of the problems supported by HeuristicLab: Artificial Ant Classification Clusterin Deceptive trap (step) Even Parity HIFF Knapsack Bin Packing Graph...

exists; see integer factorization for a discussion of this problem. Multiple polynomial quadratic sieve (MPQS) can be used to factor the public modulus n...

knapsack cryptosystems, RSA with particular settings, NTRUEncrypt, and so forth. The algorithm can be used to find integer solutions to many problems...

)\mapsto 1).} The objective, then, is to minimize η ( f ) {\displaystyle \eta (f)} . The distributed multiple- variant of the knapsack problem is as follows:...

whether x is a quadratic residue modulo N (i.e., x = y2 mod N for some y), when the Jacobi symbol for x is +1. The quadratic residue problem is easily solved...

filter Yule–Simon distribution Zeller's congruence 0-ary function 0-based indexing 0/1 knapsack problem Zhu–Takaoka string matching algorithm Zipfian distribution...