메뉴 건너뛰기




Volumn 13, Issue 4, 2013, Pages 1774-1780

Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem

Author keywords

0 1 Knapsack problem; Chemical reaction optimization; Greedy

Indexed keywords

0-1 KNAPSACK PROBLEM; ANT COLONY OPTIMIZATION (ACO); CHEMICAL-REACTION OPTIMIZATIONS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTING THEORY; CONTINUOUS PROBLEMS; ENGINEERING PROBLEMS; GREEDY; GREEDY STRATEGIES; INFEASIBLE SOLUTIONS; MULTI-MODAL; NEURAL NETWORK TRAINING; OPTIMIZATION FRAMEWORK; QUADRATIC ASSIGNMENT PROBLEMS; QUANTUM INSPIRED EVOLUTIONARY ALGORITHM; RANDOM SELECTION; REAL-LIFE APPLICATIONS; REPAIR FUNCTIONS;

EID: 84873627385     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2012.11.048     Document Type: Article
Times cited : (154)

References (31)
  • 1
    • 0024079003 scopus 로고
    • 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
  • 4
    • 0036945847 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 16
    • 12744278278 scopus 로고    scopus 로고
    • 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
  • 18
    • 34548692952 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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
  • 31
    • 78751627944 scopus 로고    scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.