Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem. - Saïd Hanafi; Raïd Mansi; Christophe Wilbaut (Hybrid Metaheuristics, 2009)

A dynamic programming algorithm for the bilevel knapsack problem. - Luce Brotcorne; Saïd Hanafi; Raïd Mansi (Oper. Res. Lett., 2009)

Approches hybrides pour des variantes du sac à dos et applications. (Exact and heuristic methods for the variants of the Knapsack problem). - Raïd Mansi (2009)

A Column Generation Approach for the Bi-objective Max-min Knapsack Problem. - Cláudio Alves; Raïd Mansi; Telmo Pinto 001; José M. Valério de Carvalho (ICORES, 2012)

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. - Igor Crévits; Saïd Hanafi; Raïd Mansi; Christophe Wilbaut (Comput. Oper. Res., 2012)

Hybrid approaches for the two-scenario max-min knapsack problem. - Saïd Hanafi; Raïd Mansi; Christophe Wilbaut; Arnaud Fréville (Int. Trans. Oper. Res., 2012)

One-level reformulation of the bilevel Knapsack problem using dynamic programming. - Luce Brotcorne; Saïd Hanafi; Raïd Mansi (Discret. Optim., 2013)

Sales Forecasting for Pricing Strategies Based on Time Series and Learning Techniques. - Jean-Christophe Ricklin; Ines Ben Amor; Raïd Mansi; Vassilis Christophides; Hajer Baazaoui Zghal (ICAART (3), 2024)

Causality-Based Approach in Retail for Finer Product Clustering. - Jean-Christophe Ricklin; Ines Ben Amor; Raïd Mansi; Vassilis Christophides; Hajer Baazaoui (AINA (2), 2025)