Polyhedral analysis for the disjunctively constrained Knapsack Problem. - Mariem Ben Salem; Raouia Taktak; Hanêne Ben-Abdallah; Ali Ridha Mahjoub (CoDIT, 2016)

Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem. - Mariem Ben Salem; Saïd Hanafi; Raouia Taktak; Hanêne Ben-Abdallah (RAIRO Oper. Res., 2017)

Optimization algorithms for the disjunctively constrained knapsack problem. - Mariem Ben Salem; Raouia Taktak; Ali Ridha Mahjoub; Hanêne Ben-Abdallah (Soft Comput., 2018)

The Labeled Two Edge Connected Subgraph Problem. - Mariem Ben Salem; Raouia Taktak (CoDIT, 2022)

The edge-labeled survivable network design problem: Formulations and branch-and-cut. - Mariem Ben Salem; Raouia Taktak; Fatmah Almathkour (RAIRO Oper. Res., 2022)