Mhand Hifi
Orcid: 0000-0002-1031-7701
According to our database1,
Mhand Hifi
authored at least 110 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Combining local branching and descent method for solving the multiple-choice knapsack problem with setups.
Int. Trans. Oper. Res., January, 2024
2023
The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems.
Knowl. Based Syst., April, 2023
A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem.
Comput. Ind. Eng., March, 2023
A rounding strategy-based algorithm for the <i>k</i>-clustering minimum biclique completion problem.
J. Oper. Res. Soc., January, 2023
Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem.
Neural Comput. Appl., 2023
Knowl. Based Syst., 2023
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors.
J. Heuristics, 2023
2022
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem.
J. Oper. Res. Soc., 2022
A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem.
Expert Syst. Appl., 2022
Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems.
Cybern. Syst., 2022
Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem.
Cybern. Syst., 2022
Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup.
Comput. Ind. Eng., 2022
Proceedings of the 8th International Conference on Control, 2022
A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem.
Proceedings of the 8th International Conference on Control, 2022
2021
Soft Comput., 2021
Oper. Res., 2021
Knowl. Based Syst., 2021
A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors.
Comput. Ind. Eng., 2021
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs.
Ann. Oper. Res., 2021
An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field.
Proceedings of the Intelligent Computing, 2021
Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup.
Proceedings of the Intelligent Computing, 2021
2020
A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs.
Expert Syst. Appl., 2020
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty.
Comput. Ind. Eng., 2020
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, 2020
An Iterative Descent Method for Predicting The Compressive Cement Strength Estimated Parameters.
Proceedings of the Communication Papers of the 2020 Federated Conference on Computer Science and Information Systems, 2020
Mathematical Model and Its Optimization to Predict the Parameters of Compressive Strength Test.
Proceedings of the Recent Advances in Computational Optimization, 2020
Proceedings of the Recent Advances in Computational Optimization, 2020
A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020
A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem.
Proceedings of the 7th International Conference on Control, 2020
Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem.
Proceedings of the 7th International Conference on Control, 2020
Proceedings of the 7th International Conference on Control, 2020
2019
2018
Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights.
Int. Trans. Oper. Res., 2018
Int. J. Intell. Eng. Informatics, 2018
Expert Syst. Appl., 2018
A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem.
Appl. Soft Comput., 2018
2017
Comput. Ind. Eng., 2017
A hybrid descent method for the two-edge disjoint survivable network design problem with relays.
Comput. Ind. Eng., 2017
Solving packing identical spheres into a smallest sphere with a particle swarm optimization.
Proceedings of the 4th International Conference on Control, 2017
Proceedings of the 4th International Conference on Control, 2017
Proceedings of the 4th International Conference on Control, 2017
2016
Eur. J. Oper. Res., 2016
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016
Proceedings of the International Conference on Control, 2016
Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem.
Proceedings of the International Conference on Control, 2016
2015
An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015
2014
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem.
Int. Trans. Oper. Res., 2014
Appl. Math. Comput., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014
Proceedings of the 2014 International Conference on Future Internet of Things and Cloud, 2014
Width Beam and Hill-Climbing Strategies for the Three-Dimensional Sphere Packing Problem.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014
Proceedings of the International Conference on Control, 2014
A hybrid large neighborhood search for the pickup and delivery problem with time windows.
Proceedings of the International Conference on Control, 2014
Proceedings of the International Conference on Control, 2014
Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints.
Proceedings of the International Conference on Control, 2014
2013
Proceedings of the Recent Advances in Computational Optimization, 2013
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study.
Discret. Optim., 2013
Solving the circular open dimension problem by using separate beams and look-ahead strategies.
Comput. Oper. Res., 2013
A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows.
Proceedings of the Recent Advances in Computational Optimization, 2013
A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013
2012
An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem.
Int. J. Comb. Optim. Probl. Informatics, 2012
A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems.
Comput. Optim. Appl., 2012
Comput. Ind. Eng., 2012
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012
Peer-to-Peer Solution of 2D Cutting Stocks Problems.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
J. Oper. Res. Soc., 2011
Comput. Ind. Eng., 2011
Comput. Ind. Eng., 2011
High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem.
Proceedings of the 19th International Euromicro Conference on Parallel, 2011
2010
J. Comb. Optim., 2010
Int. Trans. Oper. Res., 2010
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study.
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
A column generation method for the multiple-choice multi-dimensional knapsack problem.
Comput. Optim. Appl., 2010
2009
Int. J. Math. Oper. Res., 2009
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem.
Comput. Optim. Appl., 2009
Adv. Oper. Res., 2009
2008
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item.
Int. Trans. Oper. Res., 2008
Int. Trans. Oper. Res., 2008
INFORMS J. Comput., 2008
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem.
Discret. Optim., 2008
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item.
Comput. Oper. Res., 2008
Comput. Optim. Appl., 2008
A Hybrid Credit Scoring Model Based on Genetic Programming and Support Vector Machines.
Proceedings of the Fourth International Conference on Natural Computation, 2008
2007
Eur. J. Oper. Res., 2007
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem.
Comput. Oper. Res., 2007
2006
A reactive local search-based algorithm for the disjunctively constrained knapsack problem.
J. Oper. Res. Soc., 2006
Strip generation algorithms for constrained two-dimensional two-staged cutting problems.
Eur. J. Oper. Res., 2006
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem.
Comput. Optim. Appl., 2006
2005
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem.
J. Comb. Optim., 2005
Oper. Res., 2005
2004
J. Oper. Res. Soc., 2004
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems.
J. Comb. Optim., 2004
Eur. J. Oper. Res., 2004
Comput. Oper. Res., 2004
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study.
Comput. Oper. Res., 2004
2002
Stud. Inform. Univ., 2002
2001
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems.
J. Comb. Optim., 2001
Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems.
Comput. Optim. Appl., 2001
1998
An efficient approach for large-scale two-dimensional guillotine cutting stock problems.
J. Oper. Res. Soc., 1998
Comput. Oper. Res., 1998
1997
An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock.
Comput. Oper. Res., 1997