An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock. - Mhand Hifi (Comput. Oper. Res., 1997)

Exact algorithms for the guillotine strip cutting/packing problem. - Mhand Hifi (Comput. Oper. Res., 1998)

An efficient approach for large-scale two-dimensional guillotine cutting stock problems. - Didier Fayard; Mhand Hifi; Vassilis Zissimopoulos (J. Oper. Res. Soc., 1998)

Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems. - Mhand Hifi (Comput. Optim. Appl., 2001)

Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems. - Mhand Hifi; Catherine Roucairol (J. Comb. Optim., 2001)

An Efficient Algorithm for the Knapsack Sharing Problem. - Mhand Hifi; Slim Sadfi; Abdelkader Sbihi (Comput. Optim. Appl., 2002)

The Knapsack Sharing Problem: An Exact Algorithm. - Mhand Hifi; Slim Sadfi (J. Comb. Optim., 2002)

A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems. - Mhand Hifi; Rym M'Hallah (Stud. Inform. Univ., 2002)

Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. - Mhand Hifi (Comput. Oper. Res., 2004)

Approximate algorithms for constrained circular cutting problems. - Mhand Hifi; Rym M'Hallah (Comput. Oper. Res., 2004)

A simulated annealing approach for the circular cutting problem. - Mhand Hifi; Vangelis Th. Paschos; Vassilis Zissimopoulos (Eur. J. Oper. Res., 2004)

Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems. - Mhand Hifi (J. Comb. Optim., 2004)

Heuristic algorithms for the multiple-choice multidimensional knapsack problem. - Mhand Hifi; M. Michrafy; Abdelkader Sbihi (J. Oper. Res. Soc., 2004)

An exact algorithm for the knapsack sharing problem. - Mhand Hifi; Hedi M'Halla; Slim Sadfi (Comput. Oper. Res., 2005)

An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems. - Mhand Hifi; Rym M'Hallah (Oper. Res., 2005)

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. - Mhand Hifi; Hedi M'Halla; Slim Sadfi (J. Comb. Optim., 2005)

A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. - Mhand Hifi; M. Michrafy; Abdelkader Sbihi (Comput. Optim. Appl., 2006)

Strip generation algorithms for constrained two-dimensional two-staged cutting problems. - Mhand Hifi; Rym M'Hallah (Eur. J. Oper. Res., 2006)

A reactive local search-based algorithm for the disjunctively constrained knapsack problem. - Mhand Hifi; M. Michrafy (J. Oper. Res. Soc., 2006)

Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. - Mhand Hifi; M. Michrafy (Comput. Oper. Res., 2007)

A dynamic adaptive local search algorithm for the circular packing problem. - Mhand Hifi; Rym M'Hallah (Eur. J. Oper. Res., 2007)

A Hybrid Credit Scoring Model Based on Genetic Programming and Support Vector Machines. - Defu Zhang; Mhand Hifi; Qingshan Chen; Weiguo Ye (ICNC (7), 2008)

Adaptive and restarting techniques-based algorithms for circular packing problems. - Mhand Hifi; Rym M'Hallah (Comput. Optim. Appl., 2008)

Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item. - Tarik Belgacem; Mhand Hifi (Comput. Oper. Res., 2008)

Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem. - Tarik Belgacem; Mhand Hifi (Discret. Optim., 2008)

Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem. - Mhand Hifi; Rym M'Hallah; Toufik Saadi (INFORMS J. Comput., 2008)

Algorithms for the circular two-dimensional open dimension problem. - Hakim Akeb; Mhand Hifi (Int. Trans. Oper. Res., 2008)

Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item. - Tarik Belgacem; Mhand Hifi (Int. Trans. Oper. Res., 2008)

A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies. - Mhand Hifi; Rym M'Hallah (Adv. Oper. Res., 2009)

Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem. - Mhand Hifi; Rym M'Hallah; Toufik Saadi (Comput. Optim. Appl., 2009)

A beam search algorithm for the circular packing problem. - Hakim Akeb; Mhand Hifi; Rym M'Hallah (Comput. Oper. Res., 2009)

Beam search and non-linear programming tools for the circular packing problem. - Mhand Hifi; Rym M'Hallah (Int. J. Math. Oper. Res., 2009)

A column generation method for the multiple-choice multi-dimensional knapsack problem. - N. Cherfi; Mhand Hifi (Comput. Optim. Appl., 2010)

A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. - Mhand Hifi; Imed Kacem; Stéphane Nègre; Lei Wu 005 (Electron. Notes Discret. Math., 2010)

Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study. - Mhand Hifi; Hedi M'Halla (Electron. Notes Discret. Math., 2010)

Adaptive beam search lookahead algorithms for the circular packing problem. - Hakim Akeb; Mhand Hifi; Rym M'Hallah (Int. Trans. Oper. Res., 2010)

A hybrid beam search looking-ahead algorithm for the circular packing problem. - Hakim Akeb; Mhand Hifi (J. Comb. Optim., 2010)

High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem. - Mhand Hifi; Toufik Saadi; Nawel Haddadou (PDP, 2011)

Local branching-based algorithms for the disjunctively constrained knapsack problem. - Hakim Akeb; Mhand Hifi; Mohamed Elhafedh Ould Ahmed Mounir (Comput. Ind. Eng., 2011)

An augmented beam search-based algorithm for the circular open dimension problem. - Hakim Akeb; Mhand Hifi; Stéphane Nègre (Comput. Ind. Eng., 2011)

Packing circles in the smallest circle: an adaptive hybrid algorithm. - Intesar M. Al-Mudahka; Mhand Hifi; Rym M'Hallah (J. Oper. Res. Soc., 2011)

Peer-to-Peer Solution of 2D Cutting Stocks Problems. - Didier El Baz; Mhand Hifi; Toufik Saadi (CTW, 2012)

An Improved Algorithm for the Strip Packing Problem. - Hakim Akeb; Mhand Hifi; Dominique Lazure (FedCSIS, 2012)

A parallel algorithm for constrained two-staged two-dimensional cutting problems. - Mhand Hifi; Stéphane Nègre; Rachid Ouafi; Toufik Saadi (Comput. Ind. Eng., 2012)

A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems. - Mhand Hifi; Toufik Saadi (Comput. Optim. Appl., 2012)

Special issue on knapsack problems and applications. - Mhand Hifi; Rym M'Hallah (Comput. Oper. Res., 2012)

An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem. - Mhand Hifi; Lei Wu 005 (Int. J. Comb. Optim. Probl. Informatics, 2012)

A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows. - Hakim Akeb; Adel Bouchakhchoukha; Mhand Hifi (FedCSIS, 2013)

A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows. - Hakim Akeb; Adel Bouchakhchoukha; Mhand Hifi (WCO@FedCSIS, 2013)

Solving the circular open dimension problem by using separate beams and look-ahead strategies. - Hakim Akeb; Mhand Hifi (Comput. Oper. Res., 2013)

Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study. - Mhand Hifi; Hedi M'Halla (Discret. Optim., 2013)

A Heuristic Based Algorithm for the 2D Circular Strip Packing Problem. - Hakim Akeb; Mhand Hifi; Dominique Lazure (Recent Advances in Computational Optimization, 2013)

Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints. - Moudher Kh. Abdal-Hammed; Mhand Hifi; Lei Wu 005 (CoDIT, 2014)

An exact solution search for the max-min multiple knapsack problem. - Ferhan Al-Maliky; Mhand Hifi; Hedi M'Halla (CoDIT, 2014)

A hybrid large neighborhood search for the pickup and delivery problem with time windows. - Mhand Hifi; Laurent Moreau; Stéphane Nègre; Lei Wu 005 (CoDIT, 2014)

A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows. - Mhand Hifi; Lei Wu 005 (CoDIT, 2014)

Width Beam and Hill-Climbing Strategies for the Three-Dimensional Sphere Packing Problem. - Mhand Hifi; Labib Yousef (FedCSIS, 2014)

A Two-Stage Resolution Search-Based Heuristic for the Team Orienteering Problem. - Mhand Hifi; Ibrahim Moussa; Toufik Saadi (FiCloud, 2014)

A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. - Mhand Hifi; Stéphane Nègre; Toufik Saadi; Sagvan Saleh; Lei Wu 005 (IPDPS Workshops, 2014)

A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems. - Mhand Hifi; Sagvan Saleh; Lei Wu 005 (ISCO, 2014)

New upper bounds and exact methods for the knapsack sharing problem. - Mhand Hifi; Lei Wu 005 (Appl. Math. Comput., 2014)

Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. - Mhand Hifi; Stéphane Nègre; Lei Wu 005 (Int. Trans. Oper. Res., 2014)

An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems. - Mhand Hifi; Ibrahim Moussa; Toufik Saadi; Sagvan Saleh (MCO (1), 2015)

Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem. - Najat Al-Iedani; Mhand Hifi; Toufik Saadi (CoDIT, 2016)

A diversified method for the multi-scenarios max-min knapsack problem. - Thekra Al Douri; Mhand Hifi (CoDIT, 2016)

A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem. - Didier El Baz; Mhand Hifi; Lei Wu 005; Xiaochuan Shi (IPDPS Workshops, 2016)

An exact decomposition algorithm for the generalized knapsack sharing problem. - Isma Dahmani; Mhand Hifi; Lei Wu 005 (Eur. J. Oper. Res., 2016)

A reactive search for the quadratic knapsack problem. - Najat Al-Iedani; Mhand Hifi; Toufik Saadi (CoDIT, 2017)

A hybrid multi-objective evolutionary algorithm for the team orienteering problem. - Hiba Bederina; Mhand Hifi (CoDIT, 2017)

Solving packing identical spheres into a smallest sphere with a particle swarm optimization. - Mhand Hifi; Dominique Lazure; Labib Yousef (CoDIT, 2017)

A hybrid descent method for the two-edge disjoint survivable network design problem with relays. - Adel Bouchakhchoukha; Mhand Hifi (Comput. Ind. Eng., 2017)

An approximation algorithm for the k-fixed depots problem. - Aristotelis Giannakos; Mhand Hifi; R. Kheffache; Rachid Ouafi (Comput. Ind. Eng., 2017)

A new robust criterion for the vehicle routing problem with uncertain travel time. - Lei Wu 005; Mhand Hifi; Hiba Bederina (Comput. Ind. Eng., 2017)

Data Delivery by Mobile Agents with Energy Constraints over a fixed path. - Aristotelis Giannakos; Mhand Hifi; Gregory Karagiorgos (CoRR, 2017)

A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem. - Hiba Bederina; Mhand Hifi (Appl. Soft Comput., 2018)

A hybrid algorithm for packing identical spheres into a container. - Mhand Hifi; Labib Yousef (Expert Syst. Appl., 2018)

A two-stage hybrid method for the multi-scenarios max-min knapsack problem. - Thekra Aldouri; Mhand Hifi (Int. J. Intell. Eng. Informatics, 2018)

Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights. - Ferhan Al-Maliky; Mhand Hifi; Hedi M'Halla (Int. Trans. Oper. Res., 2018)

A local search-based method for sphere packing problems. - Mhand Hifi; Labib Yousef (Eur. J. Oper. Res., 2019)

A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem. - Isma Dahmani; Meriem Ferroum; Mhand Hifi; Shohre Sadeghsa (CoDIT, 2020)

Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem. - Mhand Hifi; Shohre Sadeghsa (CoDIT, 2020)

A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem. - Mhand Hifi; Amir Mohamed-Youssouf; Toufik Saadi; Labib Yousef (CoDIT, 2020)

A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors. - Méziane Aïder; Fatma Zohra Baatout; Mhand Hifi (FedCSIS, 2020)

A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors. - Méziane Aïder; Fatma Zohra Baatout; Mhand Hifi (WCO@FedCSIS, 2020)

Mathematical Model and Its Optimization to Predict the Parameters of Compressive Strength Test. - Adeline Goullieux; Mhand Hifi; Shohre Sadeghsa (WCO@FedCSIS, 2020)

An Iterative Descent Method for Predicting The Compressive Cement Strength Estimated Parameters. - Mhand Hifi; Adeline Goullieux; Shohre Sadeghsa (FedCSIS (Communication Papers), 2020)

Self Learning Strategy for the Team Orienteering Problem (SLS-TOP). - Adeline Goullieux; Mhand Hifi; Shohre Sadeghsa (ICORES, 2020)

Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty. - Lei Wu 005; Mhand Hifi (Comput. Ind. Eng., 2020)

A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs. - Isma Dahmani; Mhand Hifi; Toufik Saadi; Labib Yousef (Expert Syst. Appl., 2020)

Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup. - Samah Boukhari; Isma Dahmani; Mhand Hifi (SAI (1), 2021)

An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field. - Mhand Hifi; Shohre Sadeghsa (SAI (1), 2021)

A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. - Isma Dahmani; Mhand Hifi (Ann. Oper. Res., 2021)

A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors. - Méziane Aïder; Fatma Zohra Baatout; Mhand Hifi (Comput. Ind. Eng., 2021)

Data-driven robust optimization for the itinerary planning via large-scale GPS data. - Lei Wu 005; Mhand Hifi (Knowl. Based Syst., 2021)

An iterative algorithm for the Max-Min knapsack problem with multiple scenarios. - Thekra Al Douri; Mhand Hifi; Vassilis Zissimopoulos (Oper. Res., 2021)

An iterative rounding strategy-based algorithm for the set-union knapsack problem. - Isma Dahmani; Meriem Ferroum; Mhand Hifi (Soft Comput., 2021)

A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem. - Gérard-Michel Cochard; Mhand Hifi; E.-S. Samod; Labib Yousef (CoDIT, 2022)

A Population-Based Algorithm for the Sphere Packing Problem. - Mhand Hifi; Amir Mohamed-Youssouf; Labib Yousef (CoDIT, 2022)

A Population-Based Algorithm for Solving the Fuzzy Capacitated Maximal Covering Location Problem. - Méziane Aïder; Imene Dey; Mhand Hifi (ISCMI, 2022)

A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios. - Méziane Aïder; Mhand Hifi; Khadidja Latram (ISCMI, 2022)

Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup. - Samah Boukhari; Isma Dahmani; Mhand Hifi (Comput. Ind. Eng., 2022)

Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem. - Isma Dahmani; Meriem Ferroum; Mhand Hifi (Cybern. Syst., 2022)

Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems. - Mhand Hifi; Shohre Sadeghsa (Cybern. Syst., 2022)

A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. - Méziane Aïder; Oussama Gacem; Mhand Hifi (Expert Syst. Appl., 2022)

Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem. - Méziane Aïder; Oussama Gacem; Mhand Hifi (J. Oper. Res. Soc., 2022)

A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors. - Fatma Zohra Baatout; Mhand Hifi (J. Heuristics, 2023)

A threshold search-based population algorithm for the sphere packing problem. - Mhand Hifi; Amir Mohamed-Youssouf; Labib Yousef (Knowl. Based Syst., 2023)

Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem. - Méziane Aïder; Oussama Gacem; Mhand Hifi (Neural Comput. Appl., 2023)

A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem. - Mhand Hifi; Shohre Sadeghsa (J. Oper. Res. Soc., 2023)

A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem. - Méziane Aïder; Imene Dey; Mhand Hifi (Comput. Ind. Eng., 2023)

The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems. - Méziane Aïder; Aida-Ilham Azzi; Mhand Hifi (Knowl. Based Syst., 2023)

A Hybrid Population-Based Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors. - Fatma Zohra Baatout; Naby Doumbouya; Mhand Hifi (CoDIT, 2024)

A Cooperative Method for Solving the Set-Union Knapsack Problem. - Juntao Zhao; Mhand Hifi (CoDIT, 2024)

Tackling the Generalized Max-Mean Dispersion Problem with a Hybrid Population Method. - Juntao Zhao; Mhand Hifi (CoDIT, 2024)

An exact algorithm for the multiple-choice Knapsack problem with setups. - Samah Boukhari; Mhand Hifi (Comput. Ind. Eng., 2024)

A reinforcement learning-driven cooperative scatter search for the knapsack problem with forfeits. - Juntao Zhao; Mhand Hifi (Comput. Ind. Eng., 2024)

An incremental method-based machine learning approach for max-min knapsack with multiple scenarios. - Juntao Zhao; Mhand Hifi; Yulin Zhang 002; Xiaochuan Luo (Comput. Ind. Eng., 2024)

An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem. - Juntao Zhao; Mhand Hifi (Inf. Sci., 2024)

Combining local branching and descent method for solving the multiple-choice knapsack problem with setups. - Samah Boukhari; Mhand Hifi (Int. Trans. Oper. Res., 2024)

Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem. - Juntao Zhao; Mhand Hifi (Comput. Oper. Res., 2025)

An adaptative multi-objective scatter search for solving the dynamic bin packing problem. - Méziane Aïder; Sabrin Boulebene; Mhand Hifi (J. Heuristics, 2025)