Mhand Hifi

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 50

Top Venues

CoDIT

Comput. Ind. Eng.

Int. Trans. Oper. Res.

Expert Syst. Appl.

Publications

Juntao Zhao, Mhand Hifi, Yulin Zhang, Xiaochuan Luo
An incremental method-based machine learning approach for max-min knapsack with multiple scenarios. Comput. Ind. Eng. 190 (2024)
Samah Boukhari, Mhand Hifi
Combining local branching and descent method for solving the multiple-choice knapsack problem with setups. Int. Trans. Oper. Res. 31 (1) (2024)
Juntao Zhao, Mhand Hifi
An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem. Inf. Sci. 676 (2024)
Samah Boukhari, Mhand Hifi
An exact algorithm for the multiple-choice Knapsack problem with setups. Comput. Ind. Eng. 188 (2024)
Méziane Aider, Imene Dey, Mhand Hifi
A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem. Comput. Ind. Eng. 177 (2023)
Mhand Hifi, Amir Mohamed-Youssouf, Labib Yousef
A threshold search-based population algorithm for the sphere packing problem. Knowl. Based Syst. 261 (2023)
Fatma Zohra Baatout, Mhand Hifi
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors. J. Heuristics 29 (2) (2023)
Mhand Hifi, Shohre Sadeghsa
-clustering minimum biclique completion problem. J. Oper. Res. Soc. 74 (1) (2023)
Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi
The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems. Knowl. Based Syst. 265 (2023)
Méziane Aïder, Oussama Gacem, Mhand Hifi
Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem. Neural Comput. Appl. 35 (2) (2023)
Méziane Aïder, Oussama Gacem, Mhand Hifi
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem. J. Oper. Res. Soc. 73 (3) (2022)
Samah Boukhari, Isma Dahmani, Mhand Hifi
Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup. Comput. Ind. Eng. 165 (2022)
Gérard-Michel Cochard, Mhand Hifi, E.-S. Samod, Labib Yousef
A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem. CoDIT (2022)
Mhand Hifi, A. Mohamed Youssouf, Labib Yousef
A Population-Based Algorithm for the Sphere Packing Problem. CoDIT (2022)
Isma Dahmani, Meriem Ferroum, Mhand Hifi
Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem. Cybern. Syst. 53 (1) (2022)
Méziane Aïder, Oussama Gacem, Mhand Hifi
A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Expert Syst. Appl. 191 (2022)
Mhand Hifi, Shohre Sadeghsa
Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems. Cybern. Syst. 53 (1) (2022)
Lei Wu, Mhand Hifi
Data-driven robust optimization for the itinerary planning via large-scale GPS data. Knowl. Based Syst. 231 (2021)
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors. Comput. Ind. Eng. 158 (2021)
Thekra Al Douri, Mhand Hifi, Vassilis Zissimopoulos
An iterative algorithm for the Max-Min knapsack problem with multiple scenarios. Oper. Res. 21 (2) (2021)
Samah Boukhari, Isma Dahmani, Mhand Hifi
Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup. SAI (1) (2021)
Isma Dahmani, Mhand Hifi
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. Ann. Oper. Res. 298 (1) (2021)
Mhand Hifi, Shohre Sadeghsa
An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field. SAI (1) (2021)
Isma Dahmani, Meriem Ferroum, Mhand Hifi
An iterative rounding strategy-based algorithm for the set-union knapsack problem. Soft Comput. 25 (21) (2021)
Isma Dahmani, Meriem Ferroum, Mhand Hifi, Shohre Sadeghsa
A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem. CoDIT (2020)
Mhand Hifi, Shohre Sadeghsa
Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem. CoDIT (2020)
Lei Wu, Mhand Hifi
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty. Comput. Ind. Eng. 145 (2020)
Mhand Hifi, A. Mohamed Youssouf, Toufik Saadi, L. Youssef
A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem. CoDIT (2020)
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors. FedCSIS (2020)
Isma Dahmani, Mhand Hifi, Toufik Saadi, Labib Yousef
A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs. Expert Syst. Appl. 148 (2020)
Adeline Goullieux, Mhand Hifi, Shohre Sadeghsa
Mathematical Model and Its Optimization to Predict the Parameters of Compressive Strength Test. WCO@FedCSIS (2020)
Mhand Hifi, Adeline Goullieux, Shohre Sadeghsa
An Iterative Descent Method for Predicting The Compressive Cement Strength Estimated Parameters. FedCSIS (Communication Papers) (2020)
Adeline Goullieux, Mhand Hifi, Shohre Sadeghsa
Self Learning Strategy for the Team Orienteering Problem (SLS-TOP). ICORES (2020)
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors. WCO@FedCSIS (2020)
Mhand Hifi, Labib Yousef
A local search-based method for sphere packing problems. Eur. J. Oper. Res. 274 (2) (2019)
Thekra Aldouri, Mhand Hifi
A two-stage hybrid method for the multi-scenarios max-min knapsack problem. Int. J. Intell. Eng. Informatics 6 (1/2) (2018)
Mhand Hifi, Labib Yousef
A hybrid algorithm for packing identical spheres into a container. Expert Syst. Appl. 96 (2018)
Ferhan Al-Maliky, Mhand Hifi, Hedi M'Halla
Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights. Int. Trans. Oper. Res. 25 (2) (2018)
Hiba Bederina, Mhand Hifi
A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem. Appl. Soft Comput. 71 (2018)
Mhand Hifi, Dominique Lazure, Labib Yousef
Solving packing identical spheres into a smallest sphere with a particle swarm optimization. CoDIT (2017)
Najat Al-Iedani, Mhand Hifi, Toufik Saadi
A reactive search for the quadratic knapsack problem. CoDIT (2017)
Adel Bouchakhchoukha, Mhand Hifi
A hybrid descent method for the two-edge disjoint survivable network design problem with relays. Comput. Ind. Eng. 112 (2017)
Hiba Bederina, Mhand Hifi
A hybrid multi-objective evolutionary algorithm for the team orienteering problem. CoDIT (2017)
Aristotelis Giannakos, Mhand Hifi, R. Kheffache, Rachid Ouafi
An approximation algorithm for the k-fixed depots problem. Comput. Ind. Eng. 111 (2017)
Aristotelis Giannakos, Mhand Hifi, Gregory Karagiorgos
Data Delivery by Mobile Agents with Energy Constraints over a fixed path. CoRR (2017)
Lei Wu, Mhand Hifi, Hiba Bederina
A new robust criterion for the vehicle routing problem with uncertain travel time. Comput. Ind. Eng. 112 (2017)
Thekra Al Douri, Mhand Hifi
A diversified method for the multi-scenarios max-min knapsack problem. CoDIT (2016)
Najat Al-Iedani, Mhand Hifi, Toufik Saadi
Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem. CoDIT (2016)
Isma Dahmani, Mhand Hifi, Lei Wu
An exact decomposition algorithm for the generalized knapsack sharing problem. Eur. J. Oper. Res. 252 (3) (2016)
Didier El Baz, Mhand Hifi, Lei Wu, Xiaochuan Shi
A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem. IPDPS Workshops (2016)
Mhand Hifi, Ibrahim Moussa, Toufik Saadi, Sagvan Saleh
An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems. MCO (1) (2015)
Mhand Hifi, Labib Yousef
Width Beam and Hill-Climbing Strategies for the Three-Dimensional Sphere Packing Problem. FedCSIS (2014)
Mhand Hifi, Stéphane Nègre, Toufik Saadi, Sagvan Saleh, Lei Wu
A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. IPDPS Workshops (2014)
Moudher Kh. Abdal-Hammed, Mhand Hifi, Lei Wu
Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints. CoDIT (2014)
Mhand Hifi, Ibrahim Moussa, Toufik Saadi
A Two-Stage Resolution Search-Based Heuristic for the Team Orienteering Problem. FiCloud (2014)
Ferhan Al-Maliky, Mhand Hifi, Hedi M'Halla
An exact solution search for the max-min multiple knapsack problem. CoDIT (2014)
Mhand Hifi, Lei Wu
New upper bounds and exact methods for the knapsack sharing problem. Appl. Math. Comput. 227 (2014)
Mhand Hifi, Stéphane Nègre, Lei Wu
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. Int. Trans. Oper. Res. 21 (1) (2014)
Mhand Hifi, Sagvan Saleh, Lei Wu
A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems. ISCO (2014)
Mhand Hifi, Lei Wu
A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows. CoDIT (2014)
Mhand Hifi, Laurent Moreau, Stéphane Nègre, Lei Wu
A hybrid large neighborhood search for the pickup and delivery problem with time windows. CoDIT (2014)
Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi
A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows. FedCSIS (2013)
Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi
A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows. WCO@FedCSIS (2013)
Mhand Hifi, Hedi M'Halla
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study. Discret. Optim. 10 (4) (2013)
Hakim Akeb, Mhand Hifi
Solving the circular open dimension problem by using separate beams and look-ahead strategies. Comput. Oper. Res. 40 (5) (2013)
Mhand Hifi, Rym M'Hallah
Special issue on knapsack problems and applications. Comput. Oper. Res. 39 (1) (2012)
Hakim Akeb, Mhand Hifi, Dominique Lazure
An Improved Algorithm for the Strip Packing Problem. FedCSIS (2012)
Mhand Hifi, Toufik Saadi
A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems. Comput. Optim. Appl. 51 (2) (2012)
Mhand Hifi, Lei Wu
An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem. Int. J. Comb. Optim. Probl. Informatics 3 (3) (2012)
Mhand Hifi, Stéphane Nègre, Rachid Ouafi, Toufik Saadi
A parallel algorithm for constrained two-staged two-dimensional cutting problems. Comput. Ind. Eng. 62 (1) (2012)
Didier El Baz, Mhand Hifi, Toufik Saadi
Peer-to-Peer Solution of 2D Cutting Stocks Problems. CTW (2012)
Mhand Hifi, Toufik Saadi, Nawel Haddadou
High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem. PDP (2011)
Intesar M. Al-Mudahka, Mhand Hifi, Rym M'Hallah
Packing circles in the smallest circle: an adaptive hybrid algorithm. J. Oper. Res. Soc. 62 (11) (2011)
Hakim Akeb, Mhand Hifi, Stéphane Nègre
An augmented beam search-based algorithm for the circular open dimension problem. Comput. Ind. Eng. 61 (2) (2011)
Hakim Akeb, Mhand Hifi, Mohamed Elhafedh Ould Ahmed Mounir
Local branching-based algorithms for the disjunctively constrained knapsack problem. Comput. Ind. Eng. 60 (4) (2011)
Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. Electron. Notes Discret. Math. 36 (2010)
Hakim Akeb, Mhand Hifi, Rym M'Hallah
Adaptive beam search lookahead algorithms for the circular packing problem. Int. Trans. Oper. Res. 17 (5) (2010)
Mhand Hifi, Hedi M'Halla
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study. Electron. Notes Discret. Math. 36 (2010)
Hakim Akeb, Mhand Hifi
A hybrid beam search looking-ahead algorithm for the circular packing problem. J. Comb. Optim. 20 (2) (2010)
N. Cherfi, Mhand Hifi
A column generation method for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 46 (1) (2010)
Hakim Akeb, Mhand Hifi, Rym M'Hallah
A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36 (5) (2009)
Mhand Hifi, Rym M'Hallah
A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies. Adv. Oper. Res. 2009 (2009)
Mhand Hifi, Rym M'Hallah
Beam search and non-linear programming tools for the circular packing problem. Int. J. Math. Oper. Res. 1 (4) (2009)
Mhand Hifi, Rym M'Hallah, Toufik Saadi
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem. Comput. Optim. Appl. 42 (2) (2009)
Tarik Belgacem, Mhand Hifi
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item. Int. Trans. Oper. Res. 15 (1) (2008)
Hakim Akeb, Mhand Hifi
Algorithms for the circular two-dimensional open dimension problem. Int. Trans. Oper. Res. 15 (6) (2008)
Tarik Belgacem, Mhand Hifi
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item. Comput. Oper. Res. 35 (1) (2008)
Mhand Hifi, Rym M'Hallah, Toufik Saadi
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem. INFORMS J. Comput. 20 (2) (2008)
Defu Zhang, Mhand Hifi, Qingshan Chen, Weiguo Ye
A Hybrid Credit Scoring Model Based on Genetic Programming and Support Vector Machines. ICNC (7) (2008)
Mhand Hifi, Rym M'Hallah
Adaptive and restarting techniques-based algorithms for circular packing problems. Comput. Optim. Appl. 39 (1) (2008)
Tarik Belgacem, Mhand Hifi
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem. Discret. Optim. 5 (4) (2008)
Mhand Hifi, Rym M'Hallah
A dynamic adaptive local search algorithm for the circular packing problem. Eur. J. Oper. Res. 183 (3) (2007)
Mhand Hifi, M. Michrafy
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Comput. Oper. Res. 34 (9) (2007)
Mhand Hifi, Rym M'Hallah
Strip generation algorithms for constrained two-dimensional two-staged cutting problems. Eur. J. Oper. Res. 172 (2) (2006)
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. Comput. Optim. Appl. 33 (2-3) (2006)
Mhand Hifi, M. Michrafy
A reactive local search-based algorithm for the disjunctively constrained knapsack problem. J. Oper. Res. Soc. 57 (6) (2006)
Mhand Hifi, Rym M'Hallah
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems. Oper. Res. 53 (1) (2005)
Mhand Hifi, Hedi M'Halla, Slim Sadfi
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. J. Comb. Optim. 10 (3) (2005)
Mhand Hifi, Hedi M'Halla, Slim Sadfi
An exact algorithm for the knapsack sharing problem. Comput. Oper. Res. 32 (2005)
Mhand Hifi, Rym M'Hallah
Approximate algorithms for constrained circular cutting problems. Comput. Oper. Res. 31 (5) (2004)

Mhand Hifi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mhand Hifi