-
1
-
-
0024079003
-
A knapsack-type public key cryptosystem based on arithmetic in finite fields
-
B. Chor, and R. Rivest A knapsack-type public key cryptosystem based on arithmetic in finite fields IEEE Transactions on Information Theory 34 1988 901 909
-
(1988)
IEEE Transactions on Information Theory
, vol.34
, pp. 901-909
-
-
Chor, B.1
Rivest, R.2
-
3
-
-
85014381599
-
A new trapdoor knapsack public key cryptosystem
-
T. Beth, N. Cot, I. Ingemarsson, Springer Berlin/Heidelberg
-
R. Goodman, and A. McAuley A new trapdoor knapsack public key cryptosystem T. Beth, N. Cot, I. Ingemarsson, Advances in Cryptology, Volume 209 of Lecture Notes in Computer Science 1985 Springer Berlin/Heidelberg 150 158
-
(1985)
Advances in Cryptology, Volume 209 of Lecture Notes in Computer Science
, pp. 150-158
-
-
Goodman, R.1
McAuley, A.2
-
4
-
-
0036945847
-
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
-
K.-H. Han, and J.-H. Kim Quantum-inspired evolutionary algorithm for a class of combinatorial optimization IEEE Transactions on Evolutionary Computation 6 2002 580 593
-
(2002)
IEEE Transactions on Evolutionary Computation
, vol.6
, pp. 580-593
-
-
Han, K.-H.1
Kim, J.-H.2
-
6
-
-
0016560084
-
Fast approximation algorithms for the knapsack and sum of subset problems
-
O.H. Ibarra, and C.E. Kim Fast approximation algorithms for the knapsack and sum of subset problems Journal of ACM 22 1975 463 468
-
(1975)
Journal of ACM
, vol.22
, pp. 463-468
-
-
Ibarra, O.H.1
Kim, C.E.2
-
8
-
-
0004217585
-
A branch and bound algorithm for the knapsack problem
-
P.J. Kolesar A branch and bound algorithm for the knapsack problem Management Science 13 1967 723 735
-
(1967)
Management Science
, vol.13
, pp. 723-735
-
-
Kolesar, P.J.1
-
12
-
-
84857648810
-
Chemical reaction optimization: A tutorial
-
A.Y.S. Lam, and V.O.K. Li Chemical reaction optimization: a tutorial Memetic Computing 4 2012 3 17
-
(2012)
Memetic Computing
, vol.4
, pp. 3-17
-
-
Lam, A.Y.S.1
Li, V.O.K.2
-
15
-
-
34548128848
-
A new approach for solving 0/1 knapsack problem
-
C.-Y. Lee, Z.-J. Lee, and S.-F. Su A new approach for solving 0/1 knapsack problem IEEE International Conference on Systems, Man and Cybernetics, 2006. SMC '06, vol. 4 2006 3138 3143
-
(2006)
IEEE International Conference on Systems, Man and Cybernetics, 2006. SMC '06, Vol. 4
, pp. 3138-3143
-
-
Lee, C.-Y.1
Lee, Z.-J.2
Su, S.-F.3
-
16
-
-
12744278278
-
Optimal parallel algorithm for the knapsack problem without memory conflicts
-
K.-L. Li, R.-F. Li, and Qing-Hua Optimal parallel algorithm for the knapsack problem without memory conflicts Journal of Computer Science and Technology 19 2004 760 768 (Pubitemid 40156615)
-
(2004)
Journal of Computer Science and Technology
, vol.19
, Issue.6
, pp. 760-768
-
-
Li, K.-L.1
Li, R.-F.2
Li, Q.-H.3
-
17
-
-
70449436449
-
A novel multi-mutation binary particle swarm optimization for 0/1 knapsack problem
-
IEEE Press, Piscataway, NJ, USA
-
Z. Li, and N. Li A novel multi-mutation binary particle swarm optimization for 0/1 knapsack problem Proceedings of the 21st Annual International Conference on Chinese Control and Decision Conference. CCDC'09 IEEE Press, Piscataway, NJ, USA 2009 3090 3095
-
(2009)
Proceedings of the 21st Annual International Conference on Chinese Control and Decision Conference. CCDC'09
, pp. 3090-3095
-
-
Li, Z.1
Li, N.2
-
18
-
-
34548692952
-
Solving the knapsack problem with imprecise weight coefficients using genetic algorithms
-
DOI 10.1016/j.ejor.2006.12.046, PII S0377221707000719
-
F.-T. Lin Solving the knapsack problem with imprecise weight coefficients using genetic algorithms European Journal of Operational Research 185 2008 133 145 (Pubitemid 47418466)
-
(2008)
European Journal of Operational Research
, vol.185
, Issue.1
, pp. 133-145
-
-
Lin, F.-T.1
-
22
-
-
0016437461
-
Approximate algorithms for the 0/1 knapsack problem
-
S. Sahni Approximate algorithms for the 0/1 knapsack problem Journal of ACM 22 1975 115 124
-
(1975)
Journal of ACM
, vol.22
, pp. 115-124
-
-
Sahni, S.1
-
30
-
-
77950651063
-
Genetic algorithm based on greedy strategy in the 0-1 knapsack problem
-
J. Zhao, T. Huang, F. Pang, and Y. Liu Genetic algorithm based on greedy strategy in the 0-1 knapsack problem 3rd International Conference on Genetic and Evolutionary Computing, 2009. WGEC '09 2009 105 107
-
(2009)
3rd International Conference on Genetic and Evolutionary Computing, 2009. WGEC '09
, pp. 105-107
-
-
Zhao, J.1
Huang, T.2
Pang, F.3
Liu, Y.4
-
31
-
-
78751627944
-
Solving 0-1 knapsack problem by a novel global harmony search algorithm
-
The Impact of Soft Computing for the Progress of Artificial Intelligence
-
D. Zou, L. Gao, S. Li, and J. Wu Solving 0-1 knapsack problem by a novel global harmony search algorithm Applied Soft Computing 11 2011 1556 1564 The Impact of Soft Computing for the Progress of Artificial Intelligence
-
(2011)
Applied Soft Computing
, vol.11
, pp. 1556-1564
-
-
Zou, D.1
Gao, L.2
Li, S.3
Wu, J.4
|