Effective algorithm and heuristic for the generalized assignment problem. - Salim Haddadi; Hacene Ouzia (Eur. J. Oper. Res., 2004)

Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks. - Salim Haddadi; Omar Slimani (Algorithmic Oper. Res., 2007)

Consecutive block minimization is 1.5-approximable. - Salim Haddadi; Layouni Zoubir (Inf. Process. Lett., 2008)

The transportation problem revisited - preprocessing before using the primal-dual algorithm. - Salim Haddadi; Omar Slimani (J. Oper. Res. Soc., 2012)

Polynomial-time local-improvement algorithm for Consecutive Block Minimization. - Salim Haddadi; S. Chenche; Meryem Cheraitia; F. Guessoum (Inf. Process. Lett., 2015)

Simulated annealing for the uncapacitated exam scheduling problem. - Meryem Cheraitia; Salim Haddadi (Int. J. Metaheuristics, 2016)

Benders decomposition for set covering problems - Almost satisfying the consecutive ones property. - Salim Haddadi (J. Comb. Optim., 2017)

A two-phase heuristic for set covering. - Salim Haddadi; Meryem Cheraitia; Abdellah Salhi (Int. J. Math. Oper. Res., 2018)

Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem. - Salim Haddadi (4OR, 2019)

Iterated local search for consecutive block minimization. - Salim Haddadi (Comput. Oper. Res., 2021)

Exponential neighborhood search for consecutive block minimization. - Salim Haddadi (Int. Trans. Oper. Res., 2022)