الرئيسية › دليل الباحثين › Isma Dahmani

Isma Dahmani

الانتماء : University of Sciences and Technology Houari Boumediene

• 15منشورات (انتماء جزائري)
• 16مجموع المنشورات
• 100الاستشهادات
• 6مؤشر h

OpenAlex

مجالات البحث

• Optimization and Packing Problems
• Metaheuristic Optimization Algorithms Research
• Scheduling and Optimization Algorithms
• Complexity and Algorithms in Graphs
• Advanced Optimization Algorithms Research

المنشورات (15)

• A Hybrid Scatter Search Algorithm for the Sequencing m-Vector Bin Packing Problem
  2026 · International Conference on Control, Decision and Information Technologies (CoDIT)
• Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup
  2022 · Computers & Industrial Engineering · استُشهد به 4 مرة
• The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set-Union Knapsack Problem
  2022 · Journal of Advances in Information Technology · استُشهد به 4 مرة
• A Hybrid Evolutionary Algorithm for the Sequencing m-Vector Bin Packing Problem
  2022 · Journal of Advances in Information Technology · استُشهد به 1 مرة
• An Iterative Algorithm for Solving the Multiple Knapsack Assignment Problem
  2022 · HAL
• A Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup
  2022 · HAL
• Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem
  2021 · Cybernetics & Systems · استُشهد به 8 مرة
• An iterative rounding strategy-based algorithm for the set-union knapsack problem
  2021 · Soft Computing · استُشهد به 7 مرة
• Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup
  2021 · Lecture notes in networks and systems · استُشهد به 4 مرة
• A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs
  2020 · Expert Systems with Applications · استُشهد به 30 مرة
• A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem
  2020 · International Conference on Control, Decision and Information Technologies (CoDIT) · استُشهد به 6 مرة
• Local Branching Strategy-Based Method for the Knapsack Problem with Setup
  2020 · استُشهد به 4 مرة
• Using a perturbation strategy for a variant of the knapsack problem
  2020 · HAL
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
  2019 · Annals of Operations Research · استُشهد به 19 مرة
• An exact decomposition algorithm for the generalized knapsack sharing problem
  2016 · European Journal of Operational Research · استُشهد به 12 مرة

مجلات النشر

• HAL × 3
• International Conference on Control, Decision and Information Technologies (CoDIT) × 2
• Journal of Advances in Information Technology × 2
• Computers & Industrial Engineering × 1
• Cybernetics & Systems × 1
• Soft Computing × 1

المنشورات حسب السنة

• 20261
• 20225
• 20213
• 20204
• 20191
• 20161

التعاون العلمي

المؤسسات الشريكة : Eco-procédés, optimisation et aide à la décision · Université de Picardie Jules Verne

بلدان المؤلفين المشاركين : فرنسا

المؤلفون المشاركون

• Meriem Ferroum
• Samah Boukhari
• Khadidja Latrem
• Méziane Aı̈der

البيانات البيبليوغرافية مصدرها OpenAlex (قاعدة مفتوحة).