Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements. - Mohamed Haouari; Mehdi Mrad; Hanif D. Sherali (Optim. Lett., 2007)

Optimal solution of the discrete cost multicommodity network design problem. - Mehdi Mrad; Mohamed Haouari (Appl. Math. Comput., 2008)

Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles. - Mohamed Haouari; Nelson Maculan; Mehdi Mrad (Comput. Oper. Res., 2013)

A branch-and-price algorithm for the two-stage guillotine cutting stock problem. - Mehdi Mrad; I. Meftahi; Mohamed Haouari (J. Oper. Res. Soc., 2013)

Synchronous Routing for Personal Rapid Transit Pods. - Mehdi Mrad; Olfa Chebbi; Mohamed Labidi; Mohamed-Aly Louly (J. Appl. Math., 2014)

Optimal consumed electric energy while sequencing vehicle trips in a personal rapid transit transportation system. - Mehdi Mrad; Lotfi Hidri (Comput. Ind. Eng., 2015)

An arc flow-based optimization approach for the two-stage guillotine strip cutting problem. - Mehdi Mrad (J. Oper. Res. Soc., 2015)

An optimization-based heuristic for the machine reassignment problem. - Mehdi Mrad; Anis Gharbi; Mohamed Haouari; Mohamed Kharbeche (Ann. Oper. Res., 2016)

Nodes Migration Scheduling of Access Networks. - Mehdi Mrad; Ali Balma; Fatma Moalla; Talel Ladhari (IEEE Trans. Netw. Serv. Manag., 2017)

An Enhanced Evolutionary Approach for Solving the Nodes Migration Scheduling Problem. - Fatma Moalla; Ali Balma; Mehdi Mrad (UNet, 2018)

An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines. - Mehdi Mrad; Nizar Souayah (IEEE Access, 2018)

The GM-Contraction Principle for Mappings on an M-Metric Spaces Endowed With a Graph and Fixed Point Theorems. - Nizar Souayah; Nabil Mlaiki; Mehdi Mrad (IEEE Access, 2018)

Strong multi-commodity flow formulations for the asymmetric traveling salesman problem. - Ali Balma; Safa Ben Salem; Mehdi Mrad; Talel Ladhari (Eur. J. Oper. Res., 2018)

Risk Assessment for Discrete Stochastic Time-Cost-Quality Trade-Off Problem Using Simulation-Based Integer Linear Programming Approach. - Mehdi Mrad; Khalid S. Al-Gahtani; Rahmeto Hulchafo; Nizar Souayah; Khaled Bamatraf (IEEE Access, 2019)

Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates. - Mehdi Mrad; Sabrine Chalghoumi; Talel Ladhari; Anis Gharbi (Int. Trans. Oper. Res., 2019)

Allocating nodes to hubs for minimizing the hubs processing resources: A case study. - Ali Balma; Mehdi Mrad (RAIRO Oper. Res., 2019)

System survivability in the context of interdiction networks. - Asma Ben Yaghlane; Mohamed Naceur Azaiez; Mehdi Mrad (Reliab. Eng. Syst. Saf., 2019)

Some Fixed Point Results on Rectangular Metric-Like Spaces Endowed with a Graph. - Nizar Souayah; Mehdi Mrad (Symmetry, 2019)

A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem. - Mehdi Mrad; Olfa Harrabi; Jouhaina Chaouachi Siala; Anis Gharbi (IEEE Access, 2020)

Optimal k Cut-Sets in Attack/Defense Strategies on Networks. - Mehdi Mrad; Umar S. Suryahatmaja; Asma Ben Yaghlane; Mohamed Naceur Azaiez (IEEE Access, 2020)

Two-stage bond portfolio optimization and its application to Saudi Sukuk Market. - Nasser Aedh Alreshidi; Mehdi Mrad; Ersoy Subasi; Munevver Mine Subasi (Ann. Oper. Res., 2020)

Attack Strategies on Networks With a Budget Constraint. - Mehdi Mrad; Umar S. Suryahatmaja; Asma Ben Yaghlane; Mohamed Naceur Azaiez (IEEE Access, 2021)

Suitable Mass Density Function for an Artificial Satellite to Prevent Chaotic Motion after Collision with Space Debris. - Lotfi Hidri; Mehdi Mrad; Mohammed Alkahtani (Symmetry, 2022)

Tight lower bounds for the Traveling Salesman Problem with draft limits. - Ali Balma; Mehdi Mrad; Talel Ladhari (Comput. Oper. Res., 2023)

The K Critical Path Sets to Protect in Interdiction Networks Under Limited Defensive Resources. - Umar S. Suryahatmaja; Mehdi Mrad; Mohamed Naceur Azaiez; Asma Ben Yaghlane; Anis Gharbi (IEEE Trans. Netw. Serv. Manag., 2023)