An exact algorithm for the knapsack sharing problem. - Mhand Hifi; Hedi M'Halla; Slim Sadfi (Comput. 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)

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)

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

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

Hosting Clients in Clustered and Virtualized Environment: A Combinatorial Optimization Approach. - Yacine Laalaoui; Jehad Al-Omari; Hedi M'Halla (Artificial Intelligence Applications in Information and Communication Technologies, 2015)

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)

An exact algorithm for large knapsack sharing problems. - Yacine Laalaoui; Hedi M'Halla (INFOR Inf. Syst. Oper. Res., 2022)