Majid Forghani-elahabad
Majid Forghani-elahabad
Assistant Professor of Applied Mathematics, Universidade Federal do ABC - UFABC
Verified email at ufabc.edu.br - Homepage
TitleCited byYear
A New Efficient Approach to Search for All Multi-State Minimal Cuts
M Forghani-elahabad, N Mahdavi-Amiri
IEEE Transactions on Reliability 63 (1), 154-166, 2014
332014
A note on “A simple approach to search for all d-MCs of a limited-flow network”
HS Fathabadi, M Forghani-elahabadi
Reliability Engineering & System Safety 94 (11), 1878-1880, 2009
202009
An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint
M Forghani-elahabad, N Mahdavi-Amiri
Reliability Engineering & System Safety 142, 472-481, 2015
152015
An improved algorithm for finding all upper boundary points in a stochastic-flow network
M Forghani-elahabad, N Mahdavi-Amiri
Applied Mathematical Modelling 40 (4), 3221-3229, 2016
132016
On Search for all d-MCs in a Network Flow
M Forghani-elahabad, N Mahdavi-Amiri
Iranian Journal of Operations Research 4 (2), 108-126, 2013
122013
An improved least cost routing approach for WDM optical network without wavelength converters
L Bonani, M Forghani-elahabad
Optical Fiber Technology 32, 30-35, 2016
102016
A New Algorithm for Generating All Minimal Vectors for theSMPs Reliability Problem With Time and Budget Constraints
M Forghani-elahabad, N Mahdavi-Amiri
IEEE Transactions on Reliability 65 (2), 828-842, 2015
102015
Finding all the upper boundary points of a stochastic-flow network with budget constraints
M Forghani-elahabad, N Mahdavi-Amiri
The CSI Journal on Computer Science and Engineering 8 (2), 42-50, 2010
102010
Finding all the lower boundary points in a multistate two-terminal network
M Forghani-elahabad, LH Bonani
IEEE Transactions on Reliability 66 (3), 677-688, 2017
92017
A simple algorithm to find all minimal path vectors to demand level d in a stochastic-flow network
M Forghani-elahabad, N Mahdavi-Amiri
5-th Iranian Conference on Applied Mathematics, September 2–4, 2013 Bu-Ali …, 2013
82013
Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint
M Forghani-elahabad, N Kagan
IISE Transactions 51 (5), 547-558, 2019
52019
A simple efficient approach for the d-MinCut problem
M Forghani-elahabad, N Mahdavi-Amiri
Proceedings of International Conference on Operations Research and …, 2013
52013
An improved algorithm for RWA problem on sparse multifiber wavelength routed optical networks
M Forghani-elahabad, L H. Bonani
Optical Switching and Networking 25, 63-70, 2017
42017
A Simple Novel Algorithm for a Special Diophantine System Appeared in the System Reliability Problem
M Forghani-elahabad, L Henrique Bonani
Proceeding Series of the Brazilian Society of Computational and Applied …, 2015
32015
Multi-commodity Unreliability Evaluation for a Stochastic-Flow network
M Forghani-elahabad, N Mahdavi-Amiri
Proceedings of the 6th International Conference of Iranian Operations …, 2013
32013
Assessing reliability of multistate flow networks under cost constraint in terms of minimal cuts
M Forghani-Elahabad, N Kagan
International Journal of Reliability, Quality and Safety Engineering 26 (05 …, 2019
22019
An approximate approach for reliability evaluation of a multistate flow network in terms of minimal cuts
M Forghani-elahabad, N Kagan
Journal of Computational Science 33, 61-67, 2019
22019
Reliability assessment of a multi-source multi-sink stochastic-flow network in terms of minimal paths
M Forghani-elahabad, N Mahdavi-Amiri
Proceedings of the 9th International Conference of Iranian Operations …, 2016
22016
A simple improved algorithm to find all the lower boundary points in a multiple-node-pair multistate flow network
M Forghani-elahabad, N Kagan
Advances in Systems Science and Applications 19 (1), 1-11, 2019
12019
On multi-state two separate minimal paths reliability problem with time and budget constraints
M Forghani-Elahabad, N Mahdavi-Amiri, N Kagan
International Journal of Operational Research, 0
1
The system can't perform the operation now. Try again later.
Articles 1–20