An exact decomposition algorithm for the generalized knapsack sharing problem. - Isma Dahmani; Mhand Hifi; Lei Wu 005 (Eur. J. Oper. Res., 2016)

A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem. - Isma Dahmani; Meriem Ferroum; Mhand Hifi; Shohre Sadeghsa (CoDIT, 2020)

A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs. - Isma Dahmani; Mhand Hifi; Toufik Saadi; Labib Yousef (Expert Syst. Appl., 2020)

Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup. - Samah Boukhari; Isma Dahmani; Mhand Hifi (SAI (1), 2021)

A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. - Isma Dahmani; Mhand Hifi (Ann. Oper. Res., 2021)

An iterative rounding strategy-based algorithm for the set-union knapsack problem. - Isma Dahmani; Meriem Ferroum; Mhand Hifi (Soft Comput., 2021)

Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup. - Samah Boukhari; Isma Dahmani; Mhand Hifi (Comput. Ind. Eng., 2022)

Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem. - Isma Dahmani; Meriem Ferroum; Mhand Hifi (Cybern. Syst., 2022)