Majid Forghani-elahabad

According to our database, Majid Forghani-elahabad authored at least 19 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Usage of task and data parallelism for finding the lower boundary vectors in a stochastic-flow network.

Majid Forghani-elahabad, Emilio Francesquini

Reliab. Eng. Syst. Saf., October, 2023

Application of LSTM based on the BAT-MCS for binary-state network approximated time-dependent reliability problems.

Wei-Chang Yeh, Chia-Ming Du, Shi-Yi Tan, Majid Forghani-elahabad

Reliab. Eng. Syst. Saf., July, 2023

Assessing the reliability of multistate flow networks considering distance constraints.

Majid Forghani-elahabad

CoRR, 2023

2022

New binary-addition tree algorithm for the all-multiterminal binary-state network reliability problem.

Wei-Chang Yeh, Shi-Yi Tan, Majid Forghani-elahabad, Mohamed El Khadiri, Yunzhi Jiang, Chen-Shiun Lin

Reliab. Eng. Syst. Saf., 2022

An improved algorithm for reliability evaluation of flow networks.

Majid Forghani-elahabad, Wei-Chang Yeh

Reliab. Eng. Syst. Saf., 2022

An alternative approach to the exact network reliability assessment through the quickest path.

Majid Forghani-elahabad

CoRR, 2022

2021

Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks.

Wei-Chang Yeh, Zhifeng Hao, Majid Forghani-elahabad, Gai-Ge Wang, Yih-Lon Lin

Reliab. Eng. Syst. Saf., 2021

Assessing the performance of smart grid communication networks under both time and budget constraints.

Majid Forghani-elahabad

CoRR, 2021

2020

General multi-state rework network and reliability algorithm.

Zhifeng Hao, Wei-Chang Yeh, Zhenyao Liu, Majid Forghani-elahabad

Reliab. Eng. Syst. Saf., 2020

2019

An MP-based approximation algorithm on reliability evaluation of multistate flow networks.

Majid Forghani-elahabad, Nelson Kagan, Nezam Mahdavi-Amiri

Reliab. Eng. Syst. Saf., 2019

An approximate approach for reliability evaluation of a multistate flow network in terms of minimal cuts.

Majid Forghani-elahabad, Nelson Kagan

J. Comput. Sci., 2019

Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint.

Majid Forghani-elahabad, Nelson Kagan

IISE Trans., 2019

2017

Finding all the Lower Boundary Points in a Multistate Two-Terminal Network.

Majid Forghani-elahabad, Luiz H. Bonani

IEEE Trans. Reliab., 2017

An improved algorithm for RWA problem on sparse multifiber wavelength routed optical networks.

Majid Forghani-elahabad, Luiz H. Bonani

Opt. Switch. Netw., 2017

2016

A New Algorithm for Generating All Minimal Vectors for the q SMPs Reliability Problem With Time and Budget Constraints.

Majid Forghani-elahabad, Nezam Mahdavi-Amiri

IEEE Trans. Reliab., 2016

2015

An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint.

Majid Forghani-elahabad, Nezam Mahdavi-Amiri

Reliab. Eng. Syst. Saf., 2015

2014

A New Efficient Approach to Search for All Multi-State Minimal Cuts.

Majid Forghani-elahabad, Nezam Mahdavi-Amiri

IEEE Trans. Reliab., 2014

A Comparative Study of Different Approaches for Finding the Upper Boundary Points in Stochastic-Flow Networks.

Seyed Mehdi Mansourzadeh, Seyed Hadi Nasseri, Majid Forghani-elahabad, Ali Ebrahimnejad

Int. J. Enterp. Inf. Syst., 2014

2009

A note on "A simple approach to search for all d-MCs of a limited-flow network".

H. Salehi Fathabadi, Majid Forghani-elahabad

Reliab. Eng. Syst. Saf., 2009