الرئيسية › دليل الباحثين › Mhand Hifi
Mhand Hifi
الانتماء : Eco-procédés, optimisation et aide à la décision · Université de Picardie Jules Verne
- 50منشورات (انتماء فرنسي)
- 318مجموع المنشورات
- 3215الاستشهادات
- 33مؤشر h
الملف البحثي
لدى Mhand Hifi 50 منشور(ات) مفهرسة (1997–2026). تُنشر أعماله أساسًا في «HAL»، «International Conference on Control, Decision and Information Technologies (CoDIT)» و«Computers & Industrial Engineering». أكثر مقالاته استشهادًا هو «Approximate algorithms for constrained circular cutting problems» (2003)، وقد استُشهد به 76 مرة. 10 من هذه المنشورات تعود إلى آخر ثلاث سنوات من النشاط. شارك في تأليف أعماله 12 باحثًا على الأقل، منهم باحثون من مؤسسات في الجزائر، تونس، الصين.
هل هذا أنت؟ عرّف بأبحاثك
أنشئ ملفك على DzCademia مجانًا وأضف مقالاتك: ستظهر بسهولة أكبر على Google وفي مساعدي الذكاء الاصطناعي مثل ChatGPT، فيقرؤها ويستشهد بها عدد أكبر من الناس.
إنشاء ملفي المجاني إضافة منشوراتيمجالات البحث
- Optimization and Packing Problems
- Metaheuristic Optimization Algorithms Research
- Complexity and Algorithms in Graphs
- Vehicle Routing Optimization Methods
- Computational Geometry and Mesh Generation
المنشورات (50)
- Characterization and Predictive Modeling of Diatomite Mortar Performance: A Hybrid Framework Based on Experimental Analysis and Machine Learning Meta-Models
- An Efficient Cooperative Scatter Search for the Large-Scale k-Clustering Minimum Biclique Completion Problem
- Max-Min Knapsack Sharing: Structural Properties and a Fully Polynomial Approximation Scheme
- A Hybrid Scatter Search Algorithm for the Sequencing m-Vector Bin Packing Problem
- Elite Trajectory Exploration for Pareto Front Approximation in Dynamic Bin Packing *
- Corrosion of reinforced mortars incorporating volcanic supplementary cementitious materials under chloride–sulfate and natural Sebkha exposure
- Sustainable treatment of Congo red by natural diatomite: Isotherm modeling and environmental health implications
- Hybrid particle swarm optimization and skewed variable neighborhood search techniques for the generalized max-mean dispersion problem
- An adaptative multi-objective scatter search for solving the dynamic bin packing problem
- A Hybrid Population-Based Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors
- A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem
- A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
- The ɛ -constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p -Median Problems
- Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup
- The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set-Union Knapsack Problem
- A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios
- A Hybrid Evolutionary Algorithm for the Sequencing m-Vector Bin Packing Problem
- Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem
- A Population-Based Algorithm for the Bi-Objective Quadratic Multiple Knapsack Problem
- Une méthode hybride pour la résolution du problème d'ordonnancement de tâches multiprocesseur sur deux processeurs dédiés
- An Iterative Algorithm for Solving the Multiple Knapsack Assignment Problem
- A Hybrid Strategy for Solving the Bi-Objective Obnoxious p-Median Problem
- A Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup
- A Look-Ahead operator as a Learning Strategy for Solving Bi-objective Scheduling Multiprocessor Tasks on Two Dedicated Processors
- A Population-Based Algorithm for Solving the Fuzzy Capacitated Maximal Covering Location Problem
- A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem
- A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors
- Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem
- An iterative rounding strategy-based algorithm for the set-union knapsack problem
- Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup
- A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors
- Effect of Drop and Rebuilt Operator for solving the Bi-Objective Obnoxious p-Median Problem
- A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs
- Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
- A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors
- A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem
- Local Branching Strategy-Based Method for the Knapsack Problem with Setup
- A Two-Stage ϵ-Constraint Strategy-Based Heuristic for Bi-Objective Quadratic Multiple Knapsack Problems
- A Two-Stage epsilon-Constraint Strategy-Based Heuristic for Bi-Objective Quadratic Multiple Knapsack Problems
- Using a perturbation strategy for a variant of the knapsack problem
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- Solving the Bi-Objective Portfolio Optimization Problem with Uncertain Market Parameters: A Comparative Study
- An approximation algorithm for the k -fixed depots problem
- An exact decomposition algorithm for the generalized knapsack sharing problem
- An Approximation Algorithm for the Three Depots Hamiltonian Path Problem
- A parallel algorithm for constrained two-staged two-dimensional cutting problems
- An adaptive algorithm for the knapsack problem: perturbation of the profit or weight of an arbitrary item
- Approximate algorithms for constrained circular cutting problems
- Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates
مجلات النشر
- HAL × 9
- International Conference on Control, Decision and Information Technologies (CoDIT) × 6
- Computers & Industrial Engineering × 6
- International Conference on Soft Computing & Machine Intelligence (ISCMI) × 3
- Journal of Heuristics × 2
- Journal of Advances in Information Technology × 2
المنشورات حسب السنة
- 20266
- 20252
- 20242
- 20234
- 202212
- 20217
- 20208
- 20191
- 20181
- 20171
التعاون العلمي
المؤسسات الشريكة : University of Sciences and Technology Houari Boumediene · Modélisation, information et systèmes · CY Cergy Paris Université · Laboratoire de Mécanique et Matériaux du Génie Civil · University of Sousse
بلدان المؤلفين المشاركين : الجزائر · تونس · الصين
المؤلفون المشاركون
- Sihem Brahimi
- Isma Dahmani
- Toufik Saadi
- Shohre Sadeghsa
- Naby Doumbouya
- Hedi Mhalla
- Labib Yousef
- Slim Sadfi
- Fatma Zohra Baatout
- Lei Wu
- Méziane Aı̈der
- Rachid Ouafi
البيانات البيبليوغرافية مصدرها OpenAlex (قاعدة مفتوحة).
لماذا تختارون Dzcademia؟
ملفات أكاديمية ومقالات ومداخلات علمية: امنحوا أبحاثكم حضوراً عاماً منظماً. تساعد البيانات الوصفية المدمجة محركات البحث ومساعدات الذكاء الاصطناعي على التعرف على أعمالكم وفهم مراجعها.
علّق عبر Google
سجّل الدخول عبر Google للتعليق مباشرة على هذه الصفحة.