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

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

banned political party in Kazakhstan Quadratic knapsack problem, an extension of knapsack problem that allows for quadratic terms in the objective function...

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

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

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

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

Paths, trees, and flowers]). D. Pisinger, 2003. "Where are the hard knapsack problems?" Technical Report 2003/08, Department of Computer Science, University...

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

Dantzig–Wolfe decomposition Knapsack problem Maximum flow problem Optimization (mathematics) Travelling salesman problem Shadow price List of Jewish American...

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

0/1 knapsack problem Set cover problem Feature selection in machine learning Structured prediction in computer vision: 267–276  Arc routing problem, including...

Quadratic Problem QR-UOV Unbalanced Oil and Vinegar Multivariable Quadratic Problem SNOVA Unbalanced Oil and Vinegar Multivariable Quadratic Problem UOV...

existential forgery without resorting to the random oracle model. Quadratic residuosity problem Decisional composite residuosity assumption Barić N., Pfitzmann...

written that solve the problem in reasonable times in most cases. Similarly, algorithms can solve the NP-complete knapsack problem over a wide range of...

case of k = 2 {\displaystyle k=2} , this corresponds to the group of quadratic residues modulo a safe prime. The quotient group Z p ∗ / { 1 , − 1 } {\displaystyle...

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

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

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

that c ≡ m 2 mod p {\displaystyle c\equiv m^{2}{\bmod {p}}} , so c is a quadratic residue modulo p {\displaystyle p} . Then m p 2 ≡ c 1 2 ( p + 1 ) ≡ c...

problem multidimensional knapsack problem 0-1 knapsack problem maximum cut problem quadratic assignment problem facility layout problem wind farm layout Hyper-heuristics...

on the hardness of the problem of finding solutions to a system of multivariate quadratic equations (the so-called MQ problem) since it uses private affine...

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

even the best possible one. NP-hard problems vary greatly in their approximability; some, such as the knapsack problem, can be approximated within a multiplicative...

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

"Solve utility-scale quantum optimization problems". Retrieved 2025-02-24. Implementation of the QAOA algorithm for the knapsack problem with Classiq...

cryptosystem rests on an extension of the quadratic residuosity problem known as the higher residuosity problem. Naccache, David; Stern, Jacques (1998)...