Accueil › Annuaire des chercheurs › Abdesslem Layeb
Abdesslem Layeb
Affiliation : Université Constantine 2
- 59Publications (affiliation algérienne)
- 73Publications au total
- 1017Citations
- 15Indice h
Profil de recherche
Abdesslem Layeb compte 59 publications référencées (2005–2026). Ses travaux paraissent principalement dans « Lecture notes in networks and systems », « Communications in computer and information science » et « International Journal of Bio-Inspired Computation ». Son article le plus cité, « A novel quantum inspired cuckoo search for knapsack problems » (2011), a été cité 181 fois. 9 de ces publications datent des trois dernières années d’activité. Ses travaux sont cosignés avec au moins 12 chercheurs.
C’est vous ? Faites connaître vos travaux
Créez gratuitement votre profil DzCademia et ajoutez vos articles : ils apparaîtront plus facilement sur Google et dans les assistants d’IA comme ChatGPT. Plus de personnes pourront vous lire et vous citer.
Créer mon profil gratuit Ajouter mes publicationsDomaines de recherche
- Metaheuristic Optimization Algorithms Research
- Vehicle Routing Optimization Methods
- Quantum Computing Algorithms and Architecture
- Genomics and Phylogenetic Studies
- Constraint Satisfaction and Optimization
Publications (59)
- Front Propagation–Based Clustering: A Density-Driven Graph Framework
- Comparative Analysis of Random Distributions in Optimization Algorithms
- A Geometric Extension of KNN Classifier
- Octopus Classifier: A New Bio-inspired Classifier Based Minimal Spanning Tree
- A Novel Unsupervised Feature Selection Method Utilizing Enhanced Crowding-Based Clustering
- Differential evolution algorithms with novel mutations, adaptive parameters, and Weibull flight operator
- A Novel Crowding Clustering Algorithm for Unsupervised and Supervised Filter Feature Selection Problem
- Advanced Two-Stage Algorithm for Efficient Routing and Scheduling in Home Health Care
- TSALSHADE: improved LSHADE algorithm with tangent search
- ck-means and fck-means: Two Deterministic Initialization Procedures for k-means Algorithm Using a Modified Crowding Distance
- Trochoid Search Optimization
- CKmeans and FCKmeans : Two deterministic initialization procedures for Kmeans algorithm using a modified crowding distance
- Special Issue on Quantum Inspired Neural Networks for Engineering Optimization
- Data Clustering Using Tangent Search Algorithm
- Tangent search algorithm for solving optimization problems
- Mining Interesting Association Rules with a Modified Genetic Algorithm
- Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm
- A Greedy Clustering Algorithm for Multiple Sequence Alignment
- Metaheuristics Guided by the Apriori Principle for Association Rule Mining
- Face Recognition Using RLDA Method Based on Mutated Cuckoo Search Algorithm to Extract Optimal Features
- A GRASP algorithm based new heuristic for the capacitated location routing problem
- Frequent Itemsets Mining with Chemical Reaction Optimization Metaheuristic
- Chemical Reaction Optimization Metaheuristic for Solving Association Rule Mining Problem
- Discrete cuckoo search applied to capacitated arc routing problem
- Adaptive Cuckoo Search Algorithm for the Bin Packing Problem
- CRO-CARP: A chemical reaction optimization for Capacitated Arc Routing Problem
- Enhanced Chemical Reaction Optimization for Multi-objective Traveling Salesman Problem
- A Novel Heuristic Based Simulated Annealing for the Capacitated Location Routing Problem
- Quantum inspired cuckoo search algorithm for graph colouring problem
- Two Novel Heuristics Based on a New Density Measure for Vehicle Routing Problem
- Multi-objective chemical reaction optimization based decomposition for multi-objective traveling salesman problem
- A New Quantum Cuckoo Search Algorithm for Multiple Sequence Alignment
- A Binary Cuckoo Search Algorithm for Graph Coloring Problem
- A multi-objective chemical reaction optimisation algorithm for multi-objective travelling salesman problem
- Two novel sweep-based heuristics for the vehicle routing problem
- A novel greedy quantum inspired cuckoo search algorithm for variable sized bin packing problem
- A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems
- A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem
- A new greedy randomised adaptive search procedure for multiple sequence alignment
- A Multi-objective Binary Cuckoo Search for Bi-criteria Knapsack Problem
- A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
- A Hybrid Quantum Genetic Algorithm and Local Search based DPLL for Max 3-SAT Problems
- Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm
- A Novel Quantum Inspired Cuckoo Search Algorithm for Bin Packing Problem
- A Novel GRASP Algorithm for Solving the Bin Packing Problem
- A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem
- A novel quantum inspired cuckoo search for knapsack problems
- A Hybrid Genetic Algorithm for RNA Structural Alignment
- A New Artificial Immune System for Solving the Maximum Satisfiability Problem
- A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem
- A Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem
- A Hybrid method for effective multiple sequence alignment
- A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem
- Quantum Genetic Algorithm for Multiple RNA Structural Alignment
- Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram
- Multiple Sequence Alignment by Immune Artificial System
- Multiple sequence alignment by quantum genetic algorithm
- Multiple sequence alignment by quantum genetic algorithm
- A Quantum Evolutionary Algorithm for Effective Multiple Sequence Alignment
Revues de publication
- Lecture notes in networks and systems × 3
- Communications in computer and information science × 3
- International Journal of Bio-Inspired Computation × 3
- Lecture notes in computer science × 3
- arXiv (Cornell University) × 2
- International Journal of Applied Evolutionary Computation × 2
Publications par année
- 20261
- 20254
- 20244
- 20235
- 20221
- 20213
- 20202
- 20182
- 20172
- 20164
Collaborations
Établissements partenaires : University Frères Mentouri Constantine 1 · University of Guelma
Co-auteurs
- Salim Chıkhı
- Djamel Eddine Saïdouni
- Khadoudja Ghanem
- Abir Derouiche
- Samira Bouzoubia
- Mohamed Batouche
- Karim Bechiri
- Halima Djelloul
- Abdel Hakim Deneche
- Badis Bensedira
- Imene Ferdi
- Rostoum Abdelmoula Bourouba
Données bibliographiques issues d’OpenAlex (base ouverte).
Pourquoi choisir Dzcademia ?
Pour donner à vos travaux plus de chances d’être découverts et recommandés par les IA. Profils, articles et communications : donnez à votre recherche une présence publique structurée. Les métadonnées intégrées aident les moteurs de recherche et les assistants IA à identifier vos travaux et à comprendre leurs références.
Commenter avec Google
Connecte-toi avec Google pour commenter directement sur cette page.