Mehdi Mrad

Orcid: 0000-0002-9482-5913

According to our database1, Mehdi Mrad authored at least 25 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The K Critical Path Sets to Protect in Interdiction Networks Under Limited Defensive Resources.
IEEE Trans. Netw. Serv. Manag., December, 2023

Tight lower bounds for the Traveling Salesman Problem with draft limits.
Comput. Oper. Res., June, 2023

2022
Suitable Mass Density Function for an Artificial Satellite to Prevent Chaotic Motion after Collision with Space Debris.
Symmetry, 2022

2021
Attack Strategies on Networks With a Budget Constraint.
IEEE Access, 2021

2020
Two-stage bond portfolio optimization and its application to Saudi Sukuk Market.
Ann. Oper. Res., 2020

Optimal k Cut-Sets in Attack/Defense Strategies on Networks.
IEEE Access, 2020

A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem.
IEEE Access, 2020

2019
Some Fixed Point Results on Rectangular Metric-Like Spaces Endowed with a Graph.
Symmetry, 2019

System survivability in the context of interdiction networks.
Reliab. Eng. Syst. Saf., 2019

Allocating nodes to hubs for minimizing the hubs processing resources: A case study.
RAIRO Oper. Res., 2019

Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates.
Int. Trans. Oper. Res., 2019

Risk Assessment for Discrete Stochastic Time-Cost-Quality Trade-Off Problem Using Simulation-Based Integer Linear Programming Approach.
IEEE Access, 2019

2018
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem.
Eur. J. Oper. Res., 2018

The G<sub>M</sub>-Contraction Principle for Mappings on an M-Metric Spaces Endowed With a Graph and Fixed Point Theorems.
IEEE Access, 2018

An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines.
IEEE Access, 2018

An Enhanced Evolutionary Approach for Solving the Nodes Migration Scheduling Problem.
Proceedings of the Ubiquitous Networking - 4th International Symposium, 2018

2017
Nodes Migration Scheduling of Access Networks.
IEEE Trans. Netw. Serv. Manag., 2017

2016
An optimization-based heuristic for the machine reassignment problem.
Ann. Oper. Res., 2016

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

Optimal consumed electric energy while sequencing vehicle trips in a personal rapid transit transportation system.
Comput. Ind. Eng., 2015

2014
Synchronous Routing for Personal Rapid Transit Pods.
J. Appl. Math., 2014

2013
A branch-and-price algorithm for the two-stage guillotine cutting stock problem.
J. Oper. Res. Soc., 2013

Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles.
Comput. Oper. Res., 2013

2008
Optimal solution of the discrete cost multicommodity network design problem.
Appl. Math. Comput., 2008

2007
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements.
Optim. Lett., 2007


  Loading...