Follow
Amira GHERBOUDJ
Amira GHERBOUDJ
Computer Science
Verified email at umc.edu.dz
Title
Cited by
Cited by
Year
Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm
A Gherboudj, A Layeb, S Chikhi
International Journal of Bio-Inspired Computation 4 (4), 229-236, 2012
1472012
Méthodes de résolution de problèmes difficiles académiques
A Gherboudj
Université de Constantine2, 2013
462013
A modified hybrid particle swarm optimization algorithm for multidimensional knapsack problem
S Labed, A Gherboudj, S Chikhi
Int. J. Comput. Appl 34 (2), 1, 2011
192011
A modified hybrid particle swarm optimization algorithm for solving the traveling salesmen problem
S Labed, A Gherboudj, S Chikhi
Journal of Theoretical and Applied Information Technology 39 (2), 132-138, 2012
162012
BPSO algorithms for knapsack problem
A Gherboudj, S Chikhi
International Conference on Computer Networks and Communications, 217-227, 2011
142011
Double compression of test data using Huffman code
RS Aarthi, D Muralidharan, P Swaminathan
Journal of Theoretical and Applied Information Technology 39 (2), 104-113, 2012
132012
A new hybrid binary particle swarm optimization algorithm for multidimensional knapsack problem
A Gherboudj, S Labed, S Chikhi
Advances in Computer Science, Engineering & Applications: Proceedings of the …, 2012
112012
A modified HPSO Algorithms for Knapsack Problem. CCIS
A Gherboudj, S Chikhi
Springer, 2011
82011
African buffalo optimization for one dimensional bin packing problem
A Gherboudj
International Journal of Swarm Intelligence Research (IJSIR) 10 (4), 38-52, 2019
72019
Two discrete binary versions of African Buffalo Optimization metaheuristic
A Gherboudj
ACSIT 2018 : 6th International Conference of Advanced Computer Science …, 2018
22018
Comparative Study of Cuckoo Inspired Metaheuristics Applying to Knapsack Problems
A GHERBOUDJ
International Journal of Computer Applications 155 (12), 25-31, 2016
2016
Year of Publication: 2016
A Gherboudj
2016
The system can't perform the operation now. Try again later.
Articles 1–12