Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy

DOI10.3233/IFS-141500zbMath1351.90142MaRDI QIDQ5298457

Aijia Ouyang, Tung Khac Truong, Tien Trong Nguyen, Yuming Xu, KenLi Li

Publication date: 15 December 2016

Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)

zbMATH Keywords

greedycombinatorial0-1 knapsack problemartificial chemical reaction optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem

This page was built for publication: Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy