Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: List of knapsack problems (view), Continuous knapsack problem (view), Quadratic knapsack problem (view)

searching for Knapsack problem 9 found (83 total)

alternate case: knapsack problem

Integer relation algorithm (1,082 words) [view diff] exact match in snippet view article find links to article

14(7):2417–2423 (2004) M. van Hoeij: Factoring polynomials and the knapsack problem. J. of Number Theory, 95, 167–189, (2002). Recognizing Numerical Constants

Scilab (1,259 words) [view diff] exact match in snippet view article find links to article

1998). "An improved genetic algorithm for the multiconstrained 0-1 knapsack problem". 1998 IEEE International Conference on Evolutionary Computation Proceedings

Berlekamp–Zassenhaus algorithm (308 words) [view diff] exact match in snippet view article find links to article

MR 1256483. Van Hoeij, Mark (2002), "Factoring polynomials and the knapsack problem", Journal of Number Theory, 95 (2): 167–189, doi:10.1016/S0022-314X(01)92763-5

Sartaj Sahni (1,185 words) [view diff] exact match in snippet view article find links to article

Sahni, Sartaj (1969), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292

Croquette (3,791 words) [view diff] case mismatch in snippet view article find links to article

"Evaluation of Menu Planning Capability Based on Multi-dimensional 0/1 Knapsack Problem of Nutritional Management System". IAENG International Journal of Applied

Quantum optimization algorithms (3,576 words) [view diff] exact match in snippet view article find links to article

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

Decision tree model (3,229 words) [view diff] exact match in snippet view article find links to article

{\displaystyle n^{2}} lower bound for linear decision trees on the knapsack problem, generalized to algebraic decision trees by Steele and Yao. For Boolean

Factorization of polynomials (4,408 words) [view diff] exact match in snippet view article find links to article

Sections 5.4 and 5.6 M. van Hoeij: Factoring polynomials and the knapsack problem. Journal of Number Theory, 95, 167–189, (2002). Ruppert, W. (1999)

Natural computing (5,191 words) [view diff] exact match in snippet view article find links to article

performance of linkage-tree genetic algorithms for the multidimensional knapsack problem". Neurocomputing. 146: 17–29. doi:10.1016/j.neucom.2014.04.069. Engelbrecht