Indicator Based Ant Colony Optimization for Multi-objective Knapsack Problem. - Imen Ben Mansour; Inès Alaya (KES, 2015)

Chebyshev-based iterated local search for multi-objective optimization. - Imen Ben Mansour; Inès Alaya; Moncef Tagina (ICCP, 2017)

A Min-Max Tchebycheff Based Local Search Approach for MOMKP. - Imen Ben Mansour; Inès Alaya; Moncef Tagina (ICSOFT, 2017)

Solving Multiobjective Knapsack Problem Using Scalarizing Function Based Local Search. - Imen Ben Mansour; Inès Alaya; Moncef Tagina (ICSOFT (Selected Papers), 2017)

A multi-population algorithm for multi-objective knapsack problem. - Imen Ben Mansour; Matthieu Basseur; Frédéric Saubion (Appl. Soft Comput., 2018)

A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem. - Imen Ben Mansour; Inès Alaya; Moncef Tagina (Evol. Intell., 2019)

Indicator Weighted Based Multi-Objective Approach using Self-Adaptive Neighborhood Operator. - Imen Ben Mansour; Inès Alaya; Moncef Tagina (KES, 2021)

Optimizing Multi-objective Knapsack Problem using a Hybrid Ant Colony Approach within Multi Directional Framework. - Imen Ben Mansour (ICAART (2), 2022)

An Effective Hybrid Ant Colony Optimization for the Knapsack Problem Using Multi-Directional Search. - Imen Ben Mansour (SN Comput. Sci., 2023)