Search results
Appearance
There is a page named "0-1 quadratic knapsack problem" on Wikipedia
- The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective...24 KB (3,912 words) - 12:18, 12 August 2024
- 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...48 KB (7,649 words) - 12:12, 12 August 2024
- capacity, we can have multiple subset sum problem. Quadratic knapsack problem: Set-Union Knapsack Problem: SUKP is defined by Kellerer et al (on page...11 KB (1,082 words) - 17:51, 9 February 2024
- for many NP-complete problems, such as the knapsack problem, the traveling salesman problem, and the Boolean satisfiability problem, that can solve to optimality...63 KB (7,812 words) - 18:06, 4 August 2024
- NP-complete: MP1 Some problems related to Job-shop scheduling Knapsack problem, quadratic knapsack problem, and several variants: MP9 Some problems related to Multiprocessor...29 KB (2,749 words) - 05:24, 29 July 2024
- 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...10 KB (1,353 words) - 10:02, 20 May 2024
- Pseudo-polynomial time (section Knapsack problem)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...5 KB (876 words) - 07:57, 4 December 2023
- Delta-modular constraints. Multi-objective 0-1 knapsack problem. Parametric knapsack problem. Symmetric quadratic knapsack problem. Count-subset-sum (#SubsetSum)...35 KB (5,027 words) - 18:45, 8 August 2024
- Combinatorial optimization (redirect from NP optimization problem)optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such...18 KB (1,822 words) - 00:11, 9 June 2024
- Computational complexity theory (redirect from Intractable problem)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...49 KB (6,717 words) - 20:27, 10 August 2024
- Tanja (2019-07-29). "Knapsack Voting for Participatory Budgeting". ACM Transactions on Economics and Computation. 7 (2): 8:1–8:27. arXiv:2009.06856...29 KB (3,970 words) - 00:55, 14 August 2024
- partition problem (WCGTPP) Arc-weighted l-cardinality tree problem (AWlCTP) Multiple knapsack problem (MKP) Maximum independent set problem (MIS) Ant...77 KB (9,491 words) - 21:33, 27 July 2024
- 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...61 KB (9,265 words) - 17:23, 3 August 2024
- individual knapsack problem - finding the subset which maximizes their personal utility under the budget constraint. An advantage of knapsack voting is...11 KB (1,370 words) - 22:19, 25 July 2024
- HeuristicLab (section Supported problems)overview of the problems supported by HeuristicLab: Artificial Ant Classification Clusterin Deceptive trap (step) Even Parity HIFF Knapsack Bin Packing Graph...11 KB (1,117 words) - 19:28, 10 November 2023
- exists; see integer factorization for a discussion of this problem. Multiple polynomial quadratic sieve (MPQS) can be used to factor the public modulus n...61 KB (7,877 words) - 15:19, 2 August 2024
- knapsack cryptosystems, RSA with particular settings, NTRUEncrypt, and so forth. The algorithm can be used to find integer solutions to many problems...15 KB (2,128 words) - 15:42, 2 April 2024
- )\mapsto 1).} The objective, then, is to minimize η ( f ) {\displaystyle \eta (f)} . The distributed multiple- variant of the knapsack problem is as follows:...30 KB (3,436 words) - 01:44, 22 June 2024
- 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...7 KB (976 words) - 18:47, 24 August 2023
- filter Yule–Simon distribution Zeller's congruence 0-ary function 0-based indexing 0/1 knapsack problem Zhu–Takaoka string matching algorithm Zipfian distribution...35 KB (3,137 words) - 03:02, 24 July 2024
- three values: 0 , 1 , − 1 {\displaystyle 0,1,-1\ } . L ( a p ) { 0 , if p divides a evenly 1 , if a is a quadratic residue modulo p − 1 , if a is