default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehdi Mrad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Ali Balma
, Mehdi Mrad, Talel Ladhari:
Tight lower bounds for the Traveling Salesman Problem with draft limits. Comput. Oper. Res. 154: 106196 (2023)- [j23]Umar S. Suryahatmaja, Mehdi Mrad, Mohamed Naceur Azaiez, Asma Ben Yaghlane, Anis Gharbi:
The K Critical Path Sets to Protect in Interdiction Networks Under Limited Defensive Resources. IEEE Trans. Netw. Serv. Manag. 20(4): 5141-5154 (2023) - 2022
- [j22]Lotfi Hidri, Mehdi Mrad, Mohammed Alkahtani:
Suitable Mass Density Function for an Artificial Satellite to Prevent Chaotic Motion after Collision with Space Debris. Symmetry 14(4): 818 (2022) - 2021
- [j21]Mehdi Mrad, Umar S. Suryahatmaja, Asma Ben Yaghlane, Mohamed Naceur Azaiez:
Attack Strategies on Networks With a Budget Constraint. IEEE Access 9: 100530-100547 (2021) - 2020
- [j20]Mehdi Mrad, Olfa Harrabi, Jouhaina Chaouachi Siala, Anis Gharbi:
A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem. IEEE Access 8: 57891-57904 (2020) - [j19]Mehdi Mrad, Umar S. Suryahatmaja, Asma Ben Yaghlane, Mohamed Naceur Azaiez:
Optimal k Cut-Sets in Attack/Defense Strategies on Networks. IEEE Access 8: 131165-131177 (2020) - [j18]Nasser Aedh Alreshidi, Mehdi Mrad, Ersoy Subasi, Munevver Mine Subasi:
Two-stage bond portfolio optimization and its application to Saudi Sukuk Market. Ann. Oper. Res. 288(1): 1-43 (2020)
2010 – 2019
- 2019
- [j17]Mehdi Mrad, Khalid S. Al-Gahtani, Rahmeto Hulchafo, Nizar Souayah, Khaled Bamatraf:
Risk Assessment for Discrete Stochastic Time-Cost-Quality Trade-Off Problem Using Simulation-Based Integer Linear Programming Approach. IEEE Access 7: 32453-32463 (2019) - [j16]Mehdi Mrad, Sabrine Chalghoumi, Talel Ladhari, Anis Gharbi:
Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates. Int. Trans. Oper. Res. 26(6): 2432-2449 (2019) - [j15]Ali Balma, Mehdi Mrad:
Allocating nodes to hubs for minimizing the hubs processing resources: A case study. RAIRO Oper. Res. 53(3): 807-827 (2019) - [j14]Asma Ben Yaghlane, Mohamed Naceur Azaiez, Mehdi Mrad:
System survivability in the context of interdiction networks. Reliab. Eng. Syst. Saf. 185: 362-371 (2019) - [j13]Nizar Souayah, Mehdi Mrad:
Some Fixed Point Results on Rectangular Metric-Like Spaces Endowed with a Graph. Symmetry 11(1): 18 (2019) - 2018
- [j12]Mehdi Mrad, Nizar Souayah:
An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines. IEEE Access 6: 5300-5307 (2018) - [j11]Nizar Souayah, Nabil Mlaiki, Mehdi Mrad:
The GM-Contraction Principle for Mappings on an M-Metric Spaces Endowed With a Graph and Fixed Point Theorems. IEEE Access 6: 25178-25184 (2018) - [j10]Ali Balma, Safa Ben Salem, Mehdi Mrad, Talel Ladhari:
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem. Eur. J. Oper. Res. 271(1): 72-79 (2018) - [c1]Fatma Moalla, Ali Balma, Mehdi Mrad:
An Enhanced Evolutionary Approach for Solving the Nodes Migration Scheduling Problem. UNet 2018: 69-81 - 2017
- [j9]Mehdi Mrad, Ali Balma, Fatma Moalla, Talel Ladhari:
Nodes Migration Scheduling of Access Networks. IEEE Trans. Netw. Serv. Manag. 14(1): 77-90 (2017) - 2016
- [j8]Mehdi Mrad, Anis Gharbi, Mohamed Haouari, Mohamed Kharbeche:
An optimization-based heuristic for the machine reassignment problem. Ann. Oper. Res. 242(1): 115-132 (2016) - 2015
- [j7]Mehdi Mrad, Lotfi Hidri:
Optimal consumed electric energy while sequencing vehicle trips in a personal rapid transit transportation system. Comput. Ind. Eng. 79: 1-9 (2015) - [j6]Mehdi Mrad:
An arc flow-based optimization approach for the two-stage guillotine strip cutting problem. J. Oper. Res. Soc. 66(11): 1850-1859 (2015) - 2014
- [j5]Mehdi Mrad, Olfa Chebbi, Mohamed Labidi, Mohamed-Aly Louly:
Synchronous Routing for Personal Rapid Transit Pods. J. Appl. Math. 2014: 623849:1-623849:8 (2014) - 2013
- [j4]Mohamed Haouari, Nelson Maculan, Mehdi Mrad:
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles. Comput. Oper. Res. 40(10): 2485-2492 (2013) - [j3]Mehdi Mrad, I. Meftahi, Mohamed Haouari:
A branch-and-price algorithm for the two-stage guillotine cutting stock problem. J. Oper. Res. Soc. 64(5): 629-637 (2013)
2000 – 2009
- 2008
- [j2]Mehdi Mrad, Mohamed Haouari:
Optimal solution of the discrete cost multicommodity network design problem. Appl. Math. Comput. 204(2): 745-753 (2008) - 2007
- [j1]Mohamed Haouari, Mehdi Mrad, Hanif D. Sherali:
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements. Optim. Lett. 1(4): 341-354 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
