Articles dans des revues internationales avec comité de lecture (2017-2024)
S. Boukhari and M. Hifi. An exact algorithm for the multiple–choice Knapsack problem with setups. Computers & Industrial Engineering, 2024, 188, pp.109818. ⟨10.1016/j.cie.2023.109818⟩. ⟨hal–04465869⟩
J. Zhao, M. Hifi, Y. Zhang and X. Luo. A Cooperative Machine Learning-Based Algorithm for Approximately Solving the Max-Min knapsack with Multiple Scenarios. Proceedings of the 23th Intenational Conference on Intelligent Systems Design and Applications (ISDA23), December 11-13, 2023 (to appear in Springer).
A. Priam, A. Le Bozec, V. Dias Meireles, F. Saint and R. Cabry. Human papillomavirus seminal carriage, spermogram abnormalities and male infertily: A french cohort study. European Urology, 2023, 83, pp. S943. ⟨10.1016/S0302–2838(23)00711–X⟩. ⟨hal–04135655⟩
M. Aïder, A–I. Azzi and M. Hifi. The ɛ –constraint as a learning strategy in the population–based algorithm: The case of Bi–Objective Obnoxious p –Median Problems. Knowledge–Based Systems, 2023, 265, pp.110363. ⟨10.1016/j.knosys.2023.110363⟩. ⟨hal–04052380⟩
M. Hifi, A. Mohamed–Youssouf and L. Yousef. A threshold search–based population algorithm for the sphere packing problem. Knowledge–Based Systems, 2023, 261, pp.110177. ⟨10.1016/j.knosys.2022.110177⟩. ⟨hal–04465893⟩
F–Z Baatout and M. Hifi. A two–phase hybrid evolutionary algorithm for solving the bi–objective scheduling multiprocessor tasks on two dedicated processors. Journal of Heuristics, 2023, 29 (2–3), pp.229–267. ⟨10.1007/s10732–023–09511–0⟩. ⟨hal–04465874⟩
M. Hifi and S. Sadeghsa. A rounding strategy–based algorithm for the k –clustering minimum biclique completion problem. Journal of the Operational Research Society, 2023, 74 (1), pp.258–271. ⟨10.1080/01605682.2022.2035272⟩. ⟨hal–04011140⟩
M. Aïder, A–I. Azzi and M. Hifi. The ɛ –constraint as a learning strategy in the population–based algorithm: The case of Bi–Objective Obnoxious p –Median Problems. Knowledge–Based Systems, 2023, 265, pp.110363. ⟨10.1016/j.knosys.2023.110363⟩. ⟨hal–04465882⟩
M. Aider, I. Dey and M. Hifi. A hybrid population–based algorithm for solving the fuzzy capacitated maximal covering location problem. Computers & Industrial Engineering, 2023, 177, pp.108982. ⟨10.1016/j.cie.2023.108982⟩. ⟨hal–04465896⟩
M. Hifi, A. Mohamed–Youssouf and L. Yousef. A threshold search–based population algorithm for the sphere packing problem. Knowledge–Based Systems, 2023, 261, pp.110177. ⟨10.1016/j.knosys.2022.110177⟩. ⟨hal–03981904⟩
M. Aider, I. Dey and M. Hifi. A hybrid population–based algorithm for solving the fuzzy capacitated maximal covering location problem. Computers & Industrial Engineering, 2023, 177, pp.108982. ⟨10.1016/j.cie.2023.108982⟩. ⟨hal–04001685⟩
S. Boukhari, I. Dahmani and M. Hifi. Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup. Computers & Industrial Engineering, 2022, 165, ⟨10.1016/j.cie.2022.107934⟩. ⟨hal–03566153⟩
M. Aïder, O. Gacem and M. Hifi. Effect of learning strategies in an evolutionary method: the case of the bi–objective quadratic multiple knapsack problem. Neural Computing and Applications, 2022, 35 (2), pp.1183–1209. ⟨10.1007/s00521–022–07555–0⟩. ⟨hal–04465903⟩
M. Hifi and S. Sadeghsa. Effect of Local Branching on the Iterative Rounding–Based Method: The Case of k–Clustering Minimum Completion Problems. Cybernetics and Systems, 2022, 53 (1, SI), pp.58–79. ⟨10.1080/01969722.2021.2008682⟩. ⟨hal–03617878⟩
I. Dahmani, M. Ferroum and M. Hifi. Effect of Backtracking Strategy in Population–Based Approach: The Case of the Set–Union Knapsack Problem. Cybernetics and Systems, 2022, 53 (1, SI), pp.168–185. ⟨10.1080/01969722.2021.2008687⟩. ⟨hal–03617879⟩
M. Aïder, A. Benahmed, I. Dahmani and M. Hifi. A Hybrid Evolutionary Algorithm for the Sequencing m–Vector Bin Packing Problem. Journal of advances in information technology, 2022, 13 (4), ⟨10.12720/jait.13.4.306–311⟩. ⟨hal–04465945⟩
I. Dahmani, M. Ferroum and M. Hifi. The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set–Union Knapsack Problem. Journal of advances in information technology, 2022, 13 (3), ⟨10.12720/jait.13.3.259–264⟩. ⟨hal–04465968⟩
I. Dahmani, M. Ferroum and M. Hifi. The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set–Union Knapsack Problem. Journal of advances in information technology, 2022, 13 (3), ⟨10.12720/jait.13.3.259–264⟩. ⟨hal–03880385⟩
S. Boukhari, I. Dahmani and M. Hifi. Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup. Lecture Notes in Networks and Systems, 2022, Lecture Notes in Networks and Systems, 283, pp.154–168. ⟨10.1007/978–3–030–80119–9_7⟩. ⟨hal–04007829⟩
M. Aïder, O. Gacem and M. Hifi. Branch and solve strategies–based algorithm for the quadratic multiple knapsack problem. Journal of the Operational Research Society, 2022, 73 (3), pp.540–557. ⟨10.1080/01605682.2020.1843982⟩. ⟨hal–04011129⟩
M. Aïder, A. Benahmed, I. Dahmani and M. Hifi. A Hybrid Evolutionary Algorithm for the Sequencing m–Vector Bin Packing Problem. Journal of advances in information technology, 2022, 13 (4), ⟨10.12720/jait.13.4.306–311⟩. ⟨hal–03880383⟩
M. Aider, O. Gacem and M. Hifi. A hybrid population–based algorithm for the bi–objective quadratic multiple knapsack problem. Expert Systems with Applications, 2022, 191, ⟨10.1016/j.eswa.2021.116238⟩. ⟨hal–03617877⟩
S. Boukhari, I. Dahmani and M. Hifi. Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup. Computers & Industrial Engineering, 2022, 165, pp.107934. ⟨10.1016/j.cie.2022.107934⟩. ⟨hal–04465922⟩
M. Hifi and S. Sadeghsa. An Iterative Randomized Rounding Algorithm for the k–Clustering Minimum Completion Problem with an Application in Telecommunication Field. Lecture Notes in Networks and Systems, 2022, Lecture Notes in Networks and Systems, 283, pp.410–422. ⟨10.1007/978–3–030–80119–9_24⟩. ⟨hal–04007822⟩
M. Hifi and S. Sadeghsa. A rounding strategy–based algorithm for the k –clustering minimum biclique completion problem. Journal of the Operational Research Society, 2022, 74 (1), pp.258–271. ⟨10.1080/01605682.2022.2035272⟩. ⟨hal–04465914⟩
M. Aïder, O. Gacem and M. Hifi. A hybrid population–based algorithm for the bi–objective quadratic multiple knapsack problem. Expert Systems with Applications, 2022, 191, pp.116238. ⟨10.1016/j.eswa.2021.116238⟩. ⟨hal–04465930⟩
F-Z. Baatout, and M. Hifi. A Look–Ahead operator as a Learning Strategy for Solving Bi–objective Scheduling Multiprocessor Tasks on Two Dedicated Processors. International Journal of Machine Learning and Computing, 2022, 12 (6), ⟨10.18178/ijmlc.2022.12.6.1116⟩. ⟨hal–04465937⟩
M. Aïder, F-Z Baatout and M. Hifi. A look–ahead strategy–based method for scheduling multiprocessor tasks on two dedicated processors. Computers & Industrial Engineering, 2021, 158, pp.107388. ⟨10.1016/j.cie.2021.107388⟩. ⟨hal–04465985⟩
I. Dahmani, M. Ferroum and M. Hifi. Effect of Backtracking Strategy in Population–Based Approach: The Case of the Set–Union Knapsack Problem. Cybernetics and Systems, 2021, 53 (1), pp.168–185. ⟨10.1080/01969722.2021.2008687⟩. ⟨hal–04465973⟩
T. Renoncourt, F. Saint, Y. Bennis, L. Mondet and F. Bloch. Potentially Inappropriate Prescribing for Prostatic Hyperplasia in Older Persons. Journal of the American Medical Directors Association, 2021, ⟨10.1016/j.jamda.2021.09.023⟩. ⟨hal–03688454⟩
I. Dahmani, M. Ferroum and M. Hifi. An iterative rounding strategy–based algorithm for the set–union knapsack problem. Soft Computing, 2021, 25 (21), pp.13617–13639. ⟨10.1007/s00500–021–06091–8⟩. ⟨hal–03617881⟩
M. Hifi and S. Sadeghsa. Effect of Local Branching on the Iterative Rounding–Based Method: The Case of k –Clustering Minimum Completion Problems. Cybernetics and Systems, 2021, 53 (1), pp.58–79. ⟨10.1080/01969722.2021.2008682⟩. ⟨hal–04465925⟩
I. Dahmani, M. Ferroum and M. Hifi. An iterative rounding strategy–based algorithm for the set–union knapsack problem. Soft Computing, 2021, 25 (21), pp.13617–13639. ⟨10.1007/s00500–021–06091–8⟩. ⟨hal–04465982⟩
M. Aider, F-Z. Baatout and M. Hifi. A look–ahead strategy–based method for scheduling multiprocessor tasks on two dedicated processors. Computers & Industrial Engineering, 2021, 158, ⟨10.1016/j.cie.2021.107388⟩. ⟨hal–03617882⟩
T. Al–Douri, M. Hifi and V. Zissimopoulos. An iterative algorithm for the Max–Min knapsack problem with multiple scenarios. Operational Research, 2021, 21 (2), pp.1355–1392. ⟨10.1007/s12351–019–00463–7⟩. ⟨hal–03617883⟩
I. Dahmani and M. Hifi. A modified descent method–based heuristic for binary quadratic knapsack problems with conflict graphs. Annals of Operations Research, 2021, 298 (1–2, SI), pp.125–147. ⟨10.1007/s10479–019–03290–3⟩. ⟨hal–03617884⟩
L. Wu and M. Hifi. Data–driven robust optimization for the itinerary planning via large–scale GPS data. Knowledge–Based Systems, 2021, 231, pp.107437. ⟨10.1016/j.knosys.2021.107437⟩. ⟨hal–04465976⟩
L. Wu and M. Hifi. Discrete scenario–based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty. Computers & Industrial Engineering, 2020, 145, pp.106491. ⟨10.1016/j.cie.2020.106491⟩. ⟨hal–04466000⟩
M. Hifi and M. Masmoudi. Special Issue on Efficient and Robust (Meta)Heuristics for Industrial and Service Engineering Preface. International Journal of Applied Metaheuristic Computing, 2020, 11 (1, SI), pp.V–VI. ⟨hal–03617891⟩
L. Wu and M. Hifi. Discrete scenario–based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty. Computers & Industrial Engineering, 2020, 145, pp.106491 –. ⟨10.1016/j.cie.2020.106491⟩. ⟨hal–03490749⟩
I. Dahmani, M. Hifi, T. Saadi and L. Yousef. A swarm optimization–based search algorithm for the quadratic knapsack problem with conflict Graphs. Expert Systems with Applications, 2020, 148, pp.113224. ⟨10.1016/j.eswa.2020.113224⟩. ⟨hal–04465997⟩
I. Dahmani, M. Hifi, T. Saadi and L. Yousef. A swarm optimization–based search algorithm for the quadratic knapsack problem with conflict Graphs. Expert Systems with Applications, 2020, 148, ⟨10.1016/j.eswa.2020.113224⟩. ⟨hal–03617885⟩
M. Hifi and L. Yousef. A local search–based method for sphere packing problems. European Journal of Operational Research, 2019, 274 (2), pp.482–500. ⟨10.1016/j.ejor.2018.10.016⟩. ⟨hal–03617892⟩
D. Lecuelle, D. Basille, C. Renard, F. Saint and V. Jounieaux. Highly effective sirolimus therapy for abdominal lymphangioleiomyoma. Respiratory Medicine and Research, 2019, 75, pp.32 – 34. ⟨10.1016/j.resmer.2019.02.002⟩. ⟨hal–03486606⟩
M. Hifi and L. Yousef. A local search–based method for sphere packing problems. European Journal of Operational Research, 2019, 274 (2), pp.482–500. ⟨10.1016/j.ejor.2018.10.016⟩. ⟨hal–04466008⟩
F. Al–Maliky, M Hifi and H. Mhalla. Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights. International Transactions in Operational Research, 2018, 25 (2), pp.637–666. ⟨10.1111/itor.12373⟩. ⟨hal–03617895⟩
H. Bederina and M. Hifi. A hybrid multi–objective evolutionary optimization approach for the robust vehicle routing problem. Applied Soft Computing, 2018, 71, pp.980–993. ⟨10.1016/j.asoc.2018.07.014⟩. ⟨hal–04466010⟩
M. Hifi and L. Yousef. A hybrid algorithm for packing identical spheres into a container. Expert Systems with Applications, 2018, 96, pp.249–260. ⟨10.1016/j.eswa.2017.11.052⟩. ⟨hal–04466782⟩
T. Aldouri and M. Hifi. A two–stage hybrid method for the multi–scenarios max–min knapsack problem. International Journal of Intelligent Engineering Informatics, 2018, 6 (1–2, SI), pp.99–114. ⟨10.1504/IJIEI.2018.091011⟩. ⟨hal–03617896⟩
H. Bederina and M. Hifi. A hybrid multi–objective evolutionary optimization approach for the robust vehicle routing problem. Applied Soft Computing, 2018, 71, pp.980–993. ⟨10.1016/j.asoc.2018.07.014⟩. ⟨hal–03617893⟩
M. Hifi and L. Yousef. A global dichotomous search–based heuristic for the three–dimensional sphere packing problem. International Journal of Operational Research, 2018, 33 (2), pp.139. ⟨10.1504/IJOR.2018.095195⟩. ⟨hal–04466021⟩
M. Hifi and L. Yousef. A hybrid algorithm for packing identical spheres into a container. Expert Systems with Applications, 2018, 96, pp.249–260. ⟨10.1016/j.eswa.2017.11.052⟩. ⟨hal–03617894⟩
T. Aldouri and M. Hifi. A two–stage hybrid method for the multi–scenarios max–min knapsack problem. International Journal of Intelligent Engineering Informatics, 2018, 6 (1/2), pp.99. ⟨10.1504/IJIEI.2018.091011⟩. ⟨hal–04466027⟩
T. Aldouri and M. Hifi. A hybrid reactive search for solving the max–min knapsack problem with multi–scenarios. International Journal of Computers and Applications, 2017, 40 (1), pp.1–13. ⟨10.1080/1206212X.2016.1207426⟩. ⟨hal–04466777⟩
H. Mhalla. An exact constructive algorithm for the knapsack sharing problem. Optimization Methods and Software, 2017, 32 (5), pp.1078–1094. ⟨10.1080/10556788.2016.1240795⟩. ⟨hal–03619534⟩
A. Bouchakhchoukha and M. Hifi. A hybrid descent method for the two–edge disjoint survivable network design problem with relays. Computers & Industrial Engineering, 2017, 112, pp.645–653. ⟨10.1016/j.cie.2016.12.039⟩. ⟨hal–03617897⟩
L. Wu, M. Hifi and H. Bederina. A new robust criterion for the vehicle routing problem with uncertain travel time. Computers & Industrial Engineering, 2017, 112, pp.607–615. ⟨10.1016/j.cie.2017.05.029⟩. ⟨hal–03617898⟩
A. Giannakos, M. Hifi, R. Kheffache and R. Ouafi. An approximation algorithm for the k–fixed depots problem. Computers & Industrial Engineering, 2017, 111, pp. 50–55. ⟨10.1016/j.cie.2017.06.022⟩. ⟨hal–03617899⟩
Z. Quan and L. Wu. Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem. Concurrency and Computation: Practice and Experience, 2017, 29 (20), pp.e3848. ⟨10.1002/cpe.3848⟩. ⟨hal–03619646⟩
H. Duboureau, K. Achkar, R. Stephan, Jean–Luc Schmit and F. Saint. Ecology and fluoroquinolon resistance profiles in febrile urinary tract infections (FUTI) after prostate needle biopsy: A retrospective study in 466 biopsies. Progrès en Urologie, 2017, 27 (6), pp. 345–350. ⟨10.1016/j.purol.2017.03.014⟩. ⟨hal–03619620⟩
F. Saint, F. Rose–Robert, Y. E. Herpe, P. De Sousa and H. Sevestre. ARCHITECTV (R) urine–Neutrophil Gelatinase–Associated Lipocalin (uNGAL) essay: New prognostic marker for clear cell Renal Cell Carcinoma (ccRCC). Annals of Oncology, 2017, 28 (7), pp. 9. ⟨hal–03607765⟩