default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMajid Forghani-elahabad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Wei-Chang Yeh
, Majid Forghani-elahabad:
An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers. Big Data Cogn. Comput. 8(9): 96 (2024)- [j17]Mauricio Antonio Deffert, Majid Forghani-elahabad, Luiz Henrique Bonani:
Enhancing consecutiveness in elastic optical networks. Photonic Netw. Commun. 47(2): 97-105 (2024) - 2023
- [j16]Wei-Chang Yeh, Chia-Ming Du, Shi-Yi Tan, Majid Forghani-elahabad:
Application of LSTM based on the BAT-MCS for binary-state network approximated time-dependent reliability problems. Reliab. Eng. Syst. Saf. 235: 108954 (2023) - [j15]Majid Forghani-elahabad, Emilio Francesquini:
Usage of task and data parallelism for finding the lower boundary vectors in a stochastic-flow network. Reliab. Eng. Syst. Saf. 238: 109417 (2023) - [i3]Majid Forghani-elahabad:
Assessing the reliability of multistate flow networks considering distance constraints. CoRR abs/2311.17872 (2023) - 2022
- [j14]Majid Forghani-elahabad, Wei-Chang Yeh:
An improved algorithm for reliability evaluation of flow networks. Reliab. Eng. Syst. Saf. 221: 108371 (2022) - [j13]Wei-Chang Yeh, Shi-Yi Tan, Majid Forghani-elahabad, Mohamed El Khadiri, Yunzhi Jiang, Chen-Shiun Lin:
New binary-addition tree algorithm for the all-multiterminal binary-state network reliability problem. Reliab. Eng. Syst. Saf. 224: 108557 (2022) - [i2]Majid Forghani-elahabad:
An alternative approach to the exact network reliability assessment through the quickest path. CoRR abs/2206.04865 (2022) - 2021
- [j12]Wei-Chang Yeh, Zhifeng Hao, Majid Forghani-elahabad, Gai-Ge Wang, Yih-Lon Lin:
Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks. Reliab. Eng. Syst. Saf. 210: 107427 (2021) - [i1]Majid Forghani-elahabad:
Assessing the performance of smart grid communication networks under both time and budget constraints. CoRR abs/2107.12778 (2021) - 2020
- [j11]Zhifeng Hao, Wei-Chang Yeh, Zhenyao Liu, Majid Forghani-elahabad:
General multi-state rework network and reliability algorithm. Reliab. Eng. Syst. Saf. 203: 107048 (2020)
2010 – 2019
- 2019
- [j10]Majid Forghani-elahabad, Nelson Kagan:
Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint. IISE Trans. 51(5): 547-558 (2019) - [j9]Majid Forghani-elahabad, Nelson Kagan:
An approximate approach for reliability evaluation of a multistate flow network in terms of minimal cuts. J. Comput. Sci. 33: 61-67 (2019) - [j8]Majid Forghani-elahabad, Nelson Kagan, Nezam Mahdavi-Amiri:
An MP-based approximation algorithm on reliability evaluation of multistate flow networks. Reliab. Eng. Syst. Saf. 191 (2019) - 2017
- [j7]Majid Forghani-elahabad, Luiz H. Bonani:
An improved algorithm for RWA problem on sparse multifiber wavelength routed optical networks. Opt. Switch. Netw. 25: 63-70 (2017) - [j6]Majid Forghani-elahabad, Luiz H. Bonani:
Finding all the Lower Boundary Points in a Multistate Two-Terminal Network. IEEE Trans. Reliab. 66(3): 677-688 (2017) - 2016
- [j5]Majid Forghani-elahabad, Nezam Mahdavi-Amiri:
A New Algorithm for Generating All Minimal Vectors for the q SMPs Reliability Problem With Time and Budget Constraints. IEEE Trans. Reliab. 65(2): 828-842 (2016) - 2015
- [j4]Majid Forghani-elahabad, Nezam Mahdavi-Amiri:
An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint. Reliab. Eng. Syst. Saf. 142: 472-481 (2015) - 2014
- [j3]Seyed Mehdi Mansourzadeh, Seyed Hadi Nasseri, Majid Forghani-elahabad, Ali Ebrahimnejad:
A Comparative Study of Different Approaches for Finding the Upper Boundary Points in Stochastic-Flow Networks. Int. J. Enterp. Inf. Syst. 10(3): 13-23 (2014) - [j2]Majid Forghani-elahabad, Nezam Mahdavi-Amiri:
A New Efficient Approach to Search for All Multi-State Minimal Cuts. IEEE Trans. Reliab. 63(1): 154-166 (2014)
2000 – 2009
- 2009
- [j1]H. Salehi Fathabadi, Majid Forghani-elahabad:
A note on "A simple approach to search for all d-MCs of a limited-flow network". Reliab. Eng. Syst. Saf. 94(11): 1878-1880 (2009)
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 2025-01-20 22:53 CET 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:
