Back
Return
Biography
Prof. Mhand Hifi

Prof. Mhand Hifi

Computer Science and Operations Research

University of Picardie Jules Verne, France


Email: mhand.hifi@u-picardie.fr


Qualifications

1994 Ph.D., University of Paris 1 Pantheon-Sorbonne, France

1991 M.S., University of Paris 1-Ecole Polytechnique, France

1990 B.S., Department of Mathematics and Statistics, University of « Sciences et de la Technologie Houari-Boumediene » (USTHB)


Publications (Selected)

  1. Special Issue on « Knapsack Problems and Applications ». Computers & Operations Research, Guest Eds M. Hifi and R. M’Hallah, 2012.
  2. Special Issue on « Polyhedra and Combinatorial Optimisation ». International Journal of Mathematics in Operational ResearchGuest Eds: M.Hifi, I. Kacem and A. R. Mahjoub, 2012.
  3. Special Issue in « Operations Research ». Studia Informatica Universalis, An International Journal (HERMANN Eds). Guest Eds : H. Ait Haddadene, I. Bouchemakh and M. Hifi, 2012.
  4. Special Issue on « Cutting, Packing and Knapsacking ». Studia Informatica Universalis, An International Journal (ISBN 2-912590-13-2 ; ISSN Regular 1625-7545 ; vol 2, No 1, 2002).
  5. M. Hifi and L. WU. New upper bounds and exact methods for the knapsack sharing problem. Applied Mathematics and Computation, Vol. 227, pp. 518-530, 2014.
  6. M. Hifi, L. Wu and S. Negre. Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem, International Transactions in Operational Research, Vol. 21, Issue 1, pp. 59-79, 2014.
  7. M. Hifi. An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem. Engineering Optimization (DOI:10.1080/0305215X.2013.819096).
  8. M. Hifi and H. Mhalla. Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study. Discrete Optimization, Vol. 10, Issue 4, pages 320-330, 2013.
  9. M. Hifi, S. Negre, R. Ouafi and T. Saadi. A parallel algorithm for constrained two-staged two-dimensional cutting problems. Computers & Industrial Engineering, vol. 62, Issue 1, pp. 177-189, 2012.
  10. M. Hifi and T. Saadi. A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems. Computational Optimization and Applications, vol. 51, pp 783-807, 2012.
  11. M. Hifi and L. Wu. An equivalent model for exactly solving the multiple-choice multidimensional multiple knapsack problem. International Journal of Combinatorial Optimization Problems and Informatics, pp. 43-58, 2012.
  12. N. Cherfi and M. Hifi, A column generation method for the multiple-choice multi-dimensional knapsack problem, Computational Optimization and Applications, vol. 46, pp. 51–73, 2010.
  13. N. Cherfi and M. Hifi, Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem, International Journal of Operational Research, vol. 5, pp. 89-109, 2009.
  14. T. Belgacem and M. Hifi. Sensitivity analysis of the binary knapsack problem: perturbation of a subset of items, Discrete Optimization, vol. 5,, pp. 755-761, 2008.
  15. M. Hifi, H. Mhalla and S. Sadfi, An adaptive algorithm for the knapsack problem: perturbation of the profit or weight of an arbitrary item, European Journal of Industrial Engineering, vol. 2, No. 2  pp. 134-152, 2008.
  16. T. Belgacem and M. Hifi. Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item, International Transactions in Operational Research, vol. 15, pp. 35-49, 2008.
  17. M. Hifi, H. Mhalla and S. Sadfi, An adaptive algorithm for the knapsack problem: perturbation of the profit or weight of an arbitrary item, European Journal of Industrial Engineering, vol. 2, pp. 134–152, 2008.
  18. M. Hifi and M. Michrafy. Reduction strategies and exact algorithms for the disjunctively knapsack problem, Computers and Operations Research, vol. 34, pp. 2657-2673, 2007.

Profile Details

Null