Mhand Hifi

124 papers C 26Journal 84Unranked 13
YearRankTypeTitle / Venue / Authors
2025 J jnl
An Effective Iterated Search for the Profitable Tour Problem With Simultaneous Pickup and Delivery.
IEEE Trans. Intell. Transp. Syst.
Juntao Zhao, Mhand Hifi, Xiaochuan Luo
2025 J jnl
An adaptative multi-objective scatter search for solving the dynamic bin packing problem.
J. Heuristics
Méziane Aïder, Sabrin Boulebene, Mhand Hifi
2025 J jnl
An augmented swarm optimization algorithm for k-clustering minimum biclique completion problems.
Soft Comput.
Gérard-Michel Cochard, S. Elmi Samod, Mhand Hifi, Labib Yousef
2025 C conf
Pretrained Convolutional Neural Networks for Bladder Cancer Diagnosis via White Light Cystoscopy.
CoDIT
Haithem Dahimi, Mhand Hifi, Fabien Saint
2025 J jnl
Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem.
Comput. Oper. Res.
Juntao Zhao, Mhand Hifi
2024 C conf
A Cooperative Method for Solving the Set-Union Knapsack Problem.
CoDIT
Juntao Zhao, Mhand Hifi
2024 C conf
A Hybrid Population-Based Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors.
CoDIT
Fatma Zohra Baatout, Naby Doumbouya, Mhand Hifi
2024 J jnl
A reinforcement learning-driven cooperative scatter search for the knapsack problem with forfeits.
Comput. Ind. Eng.
Juntao Zhao, Mhand Hifi
2024 J jnl
An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem.
Inf. Sci.
Juntao Zhao, Mhand Hifi
2024 J jnl
An exact algorithm for the multiple-choice Knapsack problem with setups.
Comput. Ind. Eng.
Samah Boukhari, Mhand Hifi
2024 J jnl
An incremental method-based machine learning approach for max-min knapsack with multiple scenarios.
Comput. Ind. Eng.
Juntao Zhao, Mhand Hifi, Yulin Zhang, Xiaochuan Luo
2024 J jnl
Combining local branching and descent method for solving the multiple-choice knapsack problem with setups.
Int. Trans. Oper. Res.
Samah Boukhari, Mhand Hifi
2024 C conf
Tackling the Generalized Max-Mean Dispersion Problem with a Hybrid Population Method.
CoDIT
Juntao Zhao, Mhand Hifi
2023 J jnl
A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem.
Comput. Ind. Eng.
Méziane Aïder, Imene Dey, Mhand Hifi
2023 J jnl
A rounding strategy-based algorithm for the
J. Oper. Res. Soc.
Mhand Hifi, Shohre Sadeghsa
2023 J jnl
A threshold search-based population algorithm for the sphere packing problem.
Knowl. Based Syst.
Mhand Hifi, Amir Mohamed-Youssouf, Labib Yousef
2023 J jnl
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors.
J. Heuristics
Fatma Zohra Baatout, Mhand Hifi
2023 J jnl
Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem.
Neural Comput. Appl.
Méziane Aïder, Oussama Gacem, Mhand Hifi
2023 J jnl
The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems.
Knowl. Based Syst.
Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi
2022 — conf
A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios.
ISCMI
Méziane Aïder, Mhand Hifi, Khadidja Latram
2022 — conf
A Population-Based Algorithm for Solving the Fuzzy Capacitated Maximal Covering Location Problem.
ISCMI
Méziane Aïder, Imene Dey, Mhand Hifi
2022 C conf
A Population-Based Algorithm for the Sphere Packing Problem.
CoDIT
Mhand Hifi, Amir Mohamed-Youssouf, Labib Yousef
2022 C conf
A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem.
CoDIT
Gérard-Michel Cochard, Mhand Hifi, S. Elmi Samod, Labib Yousef
2022 J jnl
A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem.
Expert Syst. Appl.
Méziane Aïder, Oussama Gacem, Mhand Hifi
2022 J jnl
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem.
J. Oper. Res. Soc.
Méziane Aïder, Oussama Gacem, Mhand Hifi
2022 J jnl
Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem.
Cybern. Syst.
Isma Dahmani, Meriem Ferroum, Mhand Hifi
2022 J jnl
Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems.
Cybern. Syst.
Mhand Hifi, Shohre Sadeghsa
2022 J jnl
Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup.
Comput. Ind. Eng.
Samah Boukhari, Isma Dahmani, Mhand Hifi
2021 J jnl
A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors.
Comput. Ind. Eng.
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
2021 J jnl
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs.
Ann. Oper. Res.
Isma Dahmani, Mhand Hifi
2021 — conf
An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field.
SAI (1)
Mhand Hifi, Shohre Sadeghsa
2021 J jnl
An iterative algorithm for the Max-Min knapsack problem with multiple scenarios.
Oper. Res.
Thekra Al Douri, Mhand Hifi, Vassilis Zissimopoulos
2021 J jnl
An iterative rounding strategy-based algorithm for the set-union knapsack problem.
Soft Comput.
Isma Dahmani, Meriem Ferroum, Mhand Hifi
2021 — conf
Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup.
SAI (1)
Samah Boukhari, Isma Dahmani, Mhand Hifi
2021 J jnl
Data-driven robust optimization for the itinerary planning via large-scale GPS data.
Knowl. Based Syst.
Lei Wu, Mhand Hifi
2020 C conf
A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem.
CoDIT
Mhand Hifi, Amir Mohamed-Youssouf, Toufik Saadi, Labib Yousef
2020 — conf
A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors.
WCO@FedCSIS
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
2020 C conf
A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem.
CoDIT
Isma Dahmani, Meriem Ferroum, Mhand Hifi, Shohre Sadeghsa
2020 C conf
A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors.
FedCSIS
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
2020 J jnl
A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs.
Expert Syst. Appl.
Isma Dahmani, Mhand Hifi, Toufik Saadi, Labib Yousef
2020 C conf
Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem.
CoDIT
Mhand Hifi, Shohre Sadeghsa
2020 — conf
An Iterative Descent Method for Predicting The Compressive Cement Strength Estimated Parameters.
FedCSIS (Communication Papers)
Mhand Hifi, Adeline Goullieux, Shohre Sadeghsa
2020 J jnl
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty.
Comput. Ind. Eng.
Lei Wu, Mhand Hifi
2020 — conf
Mathematical Model and Its Optimization to Predict the Parameters of Compressive Strength Test.
WCO@FedCSIS
Adeline Goullieux, Mhand Hifi, Shohre Sadeghsa
2020 C conf
Self Learning Strategy for the Team Orienteering Problem (SLS-TOP).
ICORES
Adeline Goullieux, Mhand Hifi, Shohre Sadeghsa
2019 J jnl
A local search-based method for sphere packing problems.
Eur. J. Oper. Res.
Mhand Hifi, Labib Yousef
2018 J jnl
A hybrid algorithm for packing identical spheres into a container.
Expert Syst. Appl.
Mhand Hifi, Labib Yousef
2018 J jnl
A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem.
Appl. Soft Comput.
Hiba Bederina, Mhand Hifi
2018 J jnl
A two-stage hybrid method for the multi-scenarios max-min knapsack problem.
Int. J. Intell. Eng. Informatics
Thekra Aldouri, Mhand Hifi
2018 J jnl
Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights.
Int. Trans. Oper. Res.
Ferhan Al-Maliky, Mhand Hifi, Hedi M'Halla
2017 J jnl
A hybrid descent method for the two-edge disjoint survivable network design problem with relays.
Comput. Ind. Eng.
Adel Bouchakhchoukha, Mhand Hifi
2017 C conf
A hybrid multi-objective evolutionary algorithm for the team orienteering problem.
CoDIT
Hiba Bederina, Mhand Hifi
2017 J jnl
A new robust criterion for the vehicle routing problem with uncertain travel time.
Comput. Ind. Eng.
Lei Wu, Mhand Hifi, Hiba Bederina
2017 C conf
A reactive search for the quadratic knapsack problem.
CoDIT
Najat Al-Iedani, Mhand Hifi, Toufik Saadi
2017 J jnl
An approximation algorithm for the k-fixed depots problem.
Comput. Ind. Eng.
Aristotelis Giannakos, Mhand Hifi, R. Kheffache, Rachid Ouafi
2017 J jnl
Data Delivery by Mobile Agents with Energy Constraints over a fixed path.
CoRR
Aristotelis Giannakos, Mhand Hifi, Gregory Karagiorgos
2017 C conf
Solving packing identical spheres into a smallest sphere with a particle swarm optimization.
CoDIT
Mhand Hifi, Dominique Lazure, Labib Yousef
2016 — conf
A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem.
IPDPS Workshops
Didier El Baz, Mhand Hifi, Lei Wu, Xiaochuan Shi
2016 C conf
A diversified method for the multi-scenarios max-min knapsack problem.
CoDIT
Thekra Al Douri, Mhand Hifi
2016 J jnl
An exact decomposition algorithm for the generalized knapsack sharing problem.
Eur. J. Oper. Res.
Isma Dahmani, Mhand Hifi, Lei Wu
2016 C conf
Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem.
CoDIT
Najat Al-Iedani, Mhand Hifi, Toufik Saadi
2015 — conf
An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems.
MCO (1)
Mhand Hifi, Ibrahim Moussa, Toufik Saadi, Sagvan Saleh
2014 C conf
A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems.
ISCO
Mhand Hifi, Sagvan Saleh, Lei Wu
2014 — conf
A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem.
IPDPS Workshops
Mhand Hifi, Stéphane Nègre, Toufik Saadi, Sagvan Saleh, Lei Wu
2014 — conf
A Two-Stage Resolution Search-Based Heuristic for the Team Orienteering Problem.
FiCloud
Mhand Hifi, Ibrahim Moussa, Toufik Saadi
2014 C conf
A hybrid large neighborhood search for the pickup and delivery problem with time windows.
CoDIT
Mhand Hifi, Laurent Moreau, Stéphane Nègre, Lei Wu
2014 C conf
A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows.
CoDIT
Mhand Hifi, Lei Wu
2014 C conf
An exact solution search for the max-min multiple knapsack problem.
CoDIT
Ferhan Al-Maliky, Mhand Hifi, Hedi M'Halla
2014 J jnl
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem.
Int. Trans. Oper. Res.
Mhand Hifi, Stéphane Nègre, Lei Wu
2014 C conf
Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints.
CoDIT
Moudher Kh. Abdal-Hammed, Mhand Hifi, Lei Wu
2014 J jnl
New upper bounds and exact methods for the knapsack sharing problem.
Appl. Math. Comput.
Mhand Hifi, Lei Wu
2014 C conf
Width Beam and Hill-Climbing Strategies for the Three-Dimensional Sphere Packing Problem.
FedCSIS
Mhand Hifi, Labib Yousef
2013 C conf
A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows.
FedCSIS
Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi
2013 — ch.
A Heuristic Based Algorithm for the 2D Circular Strip Packing Problem.
Recent Advances in Computational Optimization
Hakim Akeb, Mhand Hifi, Dominique Lazure
2013 — conf
A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows.
WCO@FedCSIS
Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi
2013 J jnl
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study.
Discret. Optim.
Mhand Hifi, Hedi M'Halla
2013 J jnl
Solving the circular open dimension problem by using separate beams and look-ahead strategies.
Comput. Oper. Res.
Hakim Akeb, Mhand Hifi
2012 J jnl
A parallel algorithm for constrained two-staged two-dimensional cutting problems.
Comput. Ind. Eng.
Mhand Hifi, Stéphane Nègre, Rachid Ouafi, Toufik Saadi
2012 J jnl
A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems.
Comput. Optim. Appl.
Mhand Hifi, Toufik Saadi
2012 C conf
An Improved Algorithm for the Strip Packing Problem.
FedCSIS
Hakim Akeb, Mhand Hifi, Dominique Lazure
2012 J jnl
An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem.
Int. J. Comb. Optim. Probl. Informatics
Mhand Hifi, Lei Wu
2012 C conf
Peer-to-Peer Solution of 2D Cutting Stocks Problems.
CTW
Didier El Baz, Mhand Hifi, Toufik Saadi
2012 J jnl
Special issue on knapsack problems and applications.
Comput. Oper. Res.
Mhand Hifi, Rym M'Hallah
2011 J jnl
An augmented beam search-based algorithm for the circular open dimension problem.
Comput. Ind. Eng.
Hakim Akeb, Mhand Hifi, Stéphane Nègre
2011 C conf
High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem.
PDP
Mhand Hifi, Toufik Saadi, Nawel Haddadou
2011 J jnl
Local branching-based algorithms for the disjunctively constrained knapsack problem.
Comput. Ind. Eng.
Hakim Akeb, Mhand Hifi, Mohamed Elhafedh Ould Ahmed Mounir
2011 J jnl
Packing circles in the smallest circle: an adaptive hybrid algorithm.
J. Oper. Res. Soc.
Intesar M. Al-Mudahka, Mhand Hifi, Rym M'Hallah
2010 J jnl
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem.
Electron. Notes Discret. Math.
Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu
2010 J jnl
A column generation method for the multiple-choice multi-dimensional knapsack problem.
Comput. Optim. Appl.
N. Cherfi, Mhand Hifi
2010 J jnl
A hybrid beam search looking-ahead algorithm for the circular packing problem.
J. Comb. Optim.
Hakim Akeb, Mhand Hifi
2010 J jnl
Adaptive beam search lookahead algorithms for the circular packing problem.
Int. Trans. Oper. Res.
Hakim Akeb, Mhand Hifi, Rym M'Hallah
2010 J jnl
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study.
Electron. Notes Discret. Math.
Mhand Hifi, Hedi M'Halla
2009 J jnl
A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies.
Adv. Oper. Res.
Mhand Hifi, Rym M'Hallah
2009 J jnl
A beam search algorithm for the circular packing problem.
Comput. Oper. Res.
Hakim Akeb, Mhand Hifi, Rym M'Hallah
2009 J jnl
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem.
Comput. Optim. Appl.
Mhand Hifi, Rym M'Hallah, Toufik Saadi
2009 J jnl
Beam search and non-linear programming tools for the circular packing problem.
Int. J. Math. Oper. Res.
Mhand Hifi, Rym M'Hallah
2008 — conf
A Hybrid Credit Scoring Model Based on Genetic Programming and Support Vector Machines.
ICNC (7)
Defu Zhang, Mhand Hifi, Qingshan Chen, Weiguo Ye
2008 J jnl
Adaptive and restarting techniques-based algorithms for circular packing problems.
Comput. Optim. Appl.
Mhand Hifi, Rym M'Hallah
2008 J jnl
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem.
INFORMS J. Comput.
Mhand Hifi, Rym M'Hallah, Toufik Saadi
2008 J jnl
Algorithms for the circular two-dimensional open dimension problem.
Int. Trans. Oper. Res.
Hakim Akeb, Mhand Hifi
2008 J jnl
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item.
Comput. Oper. Res.
Tarik Belgacem, Mhand Hifi
2008 J jnl
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item.
Int. Trans. Oper. Res.
Tarik Belgacem, Mhand Hifi
2008 J jnl
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem.
Discret. Optim.
Tarik Belgacem, Mhand Hifi
2007 J jnl
A dynamic adaptive local search algorithm for the circular packing problem.
Eur. J. Oper. Res.
Mhand Hifi, Rym M'Hallah
2007 J jnl
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem.
Comput. Oper. Res.
Mhand Hifi, M. Michrafy
2006 J jnl
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem.
Comput. Optim. Appl.
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
2006 J jnl
A reactive local search-based algorithm for the disjunctively constrained knapsack problem.
J. Oper. Res. Soc.
Mhand Hifi, M. Michrafy
2006 J jnl
Strip generation algorithms for constrained two-dimensional two-staged cutting problems.
Eur. J. Oper. Res.
Mhand Hifi, Rym M'Hallah
2005 J jnl
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems.
Oper. Res.
Mhand Hifi, Rym M'Hallah
2005 J jnl
An exact algorithm for the knapsack sharing problem.
Comput. Oper. Res.
Mhand Hifi, Hedi M'Halla, Slim Sadfi
2005 J jnl
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem.
J. Comb. Optim.
Mhand Hifi, Hedi M'Halla, Slim Sadfi
2004 J jnl
A simulated annealing approach for the circular cutting problem.
Eur. J. Oper. Res.
Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos
2004 J jnl
Approximate algorithms for constrained circular cutting problems.
Comput. Oper. Res.
Mhand Hifi, Rym M'Hallah
2004 J jnl
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems.
J. Comb. Optim.
Mhand Hifi
2004 J jnl
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study.
Comput. Oper. Res.
Mhand Hifi
2004 J jnl
Heuristic algorithms for the multiple-choice multidimensional knapsack problem.
J. Oper. Res. Soc.
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
2002 J jnl
A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems.
Stud. Inform. Univ.
Mhand Hifi, Rym M'Hallah
2002 J jnl
An Efficient Algorithm for the Knapsack Sharing Problem.
Comput. Optim. Appl.
Mhand Hifi, Slim Sadfi, Abdelkader Sbihi
2002 J jnl
The Knapsack Sharing Problem: An Exact Algorithm.
J. Comb. Optim.
Mhand Hifi, Slim Sadfi
2001 J jnl
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems.
J. Comb. Optim.
Mhand Hifi, Catherine Roucairol
2001 J jnl
Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems.
Comput. Optim. Appl.
Mhand Hifi
1998 J jnl
An efficient approach for large-scale two-dimensional guillotine cutting stock problems.
J. Oper. Res. Soc.
Didier Fayard, Mhand Hifi, Vassilis Zissimopoulos
1998 J jnl
Exact algorithms for the guillotine strip cutting/packing problem.
Comput. Oper. Res.
Mhand Hifi
1997 J jnl
An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock.
Comput. Oper. Res.
Mhand Hifi