Majid Forghani-Elahabad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Majid Forghani-Elahabad has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
Nelson Kagan
5 shared publications- Nezam Mahdavi-Amiri
Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran
5 shared publications - Ali Mohades
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
3 shared publications - Luiz Henrique Bonani
Universidade Federal do ABC, Brazil
3 shared publications - Wei-Chang Yeh
Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 300, Taiwan
3 shared publications - Emilio Francesquini
UFABC
2 shared publications
Latest Publications
- Open Access
- 16 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3764
An Editorial Note to the Special Issue Titled “Graph Theory and Network Theory”
Graph theory and network theory have become critical tools for modeling, analyzing, and assessing complex systems, such as communication networks, transportation systems, power grids, wireless sensor networks, and supply chain infrastructures
- 16 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3764
Open AccessAn Editorial Note to the Special Issue Titled “Graph Theory and Network Theory”
Graph theory and network theory have become critical tools for modeling, analyzing, and assessing complex systems, such as communication networks, transportation systems, power grids, wireless sensor networks, and supply chain infrastructures
- Open Access
- 19 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 12299
Data-Driven Planning Phase of Maritime SAR Using Satellite Observations
Maritime search and rescue operations rely on accurate drift predictions to define effective search areas for missing persons. Existing systems often depict uncertainty using statistical ellipses or ensemble-based probability maps, which may not effectively capture directional biases and underlying flow structures. In this study, we introduce a geometric framework that constructs possible object trajectories directly from the drift dynamics. Starting from the last known position, we integrate the translational and rotational drift components with arbitrary perturbations to model realistic scenarios. The resulting envelope of the trajectories defines a reachable set that adapts to the flow without relying on sampling or covariance estimations. Using satellite-derived wind and current data, we demonstrat that this approach produces envelopes that are physically consistent and operationally relevant. Our method offers a mathematically grounded alternative to ensemble techniques, enhancing interpretability and improving the SAR planning efficiency. We illustrate its effectiveness with examples that simulate real-world scenarios.
- 19 November 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (22) , 12299
Open AccessData-Driven Planning Phase of Maritime SAR Using Satellite Observations
Maritime search and rescue operations rely on accurate drift predictions to define effective search areas for missing persons. Existing systems often depict uncertainty using statistical ellipses or ensemble-based probability maps, which may not effectively capture directional biases and underlying flow structures. In this study, we introduce a geometric framework that constructs possible object trajectories directly from the drift dynamics. Starting from the last known position, we integrate the translational and rotational drift components with arbitrary perturbations to model realistic scenarios. The resulting envelope of the trajectories defines a reachable set that adapts to the flow without relying on sampling or covariance estimations. Using satellite-derived wind and current data, we demonstrat that this approach produces envelopes that are physically consistent and operationally relevant. Our method offers a mathematically grounded alternative to ensemble techniques, enhancing interpretability and improving the SAR planning efficiency. We illustrate its effectiveness with examples that simulate real-world scenarios.
- 15 August 2025
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 150
Cost-constrained reliability assessment of multistate flow networks with multiple sources
- 15 August 2025
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 150
Cost-constrained reliability assessment of multistate flow networks with multiple sources
- Open Access
- 20 January 2025
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 11 (1) , 1-7
Buscando os dois caminhos mínimos disjuntos mais confiáveis em uma rede de fluxo multiestado com restrição de tempo
Este artigo aborda o desafio de encontrar os dois Caminhos Mínimos Disjuntos (CMDs) mais confiáveis de uma rede de fluxo multiestado para transmitir d unidades de dados do nó de origem para o nó de destino em um período de T unidades de tempo. Definimos a confiabilidade de um Caminho Mínimo (CM) e calculamos a quantidade máxima de dados que pode ser enviada através de um CM em T unidades de tempo. Em seguida, determinamos todas as possibilidades de divisão de d unidades de dados entre dois CMDs. Por fim, propomos um algoritmo para encontrar os CMDs desejados e ilustramos o método por meio de um exemplo de rede de referência.
- 20 January 2025
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 11 (1) , 1-7
Open AccessBuscando os dois caminhos mínimos disjuntos mais confiáveis em uma rede de fluxo multiestado com restrição de tempo
Este artigo aborda o desafio de encontrar os dois Caminhos Mínimos Disjuntos (CMDs) mais confiáveis de uma rede de fluxo multiestado para transmitir d unidades de dados do nó de origem para o nó de destino em um período de T unidades de tempo. Definimos a confiabilidade de um Caminho Mínimo (CM) e calculamos a quantidade máxima de dados que pode ser enviada através de um CM em T unidades de tempo. Em seguida, determinamos todas as possibilidades de divisão de d unidades de dados entre dois CMDs. Por fim, propomos um algoritmo para encontrar os CMDs desejados e ilustramos o método por meio de um exemplo de rede de referência.
- 4 December 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 361 (3) , 1091-1112
An efficient parallel approach for binary-state network reliability problems
- 4 December 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 361 (3) , 1091-1112
An efficient parallel approach for binary-state network reliability problems
- Open Access
- 23 August 2024
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 8 (9) , 96
An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers
Data structures such as sets, lists, and arrays are fundamental in mathematics and computer science, playing a crucial role in numerous real-life applications. These structures represent a variety of entities, including solutions, conditions, and objectives. In scenarios involving large datasets, eliminating duplicate elements is essential to reduce complexity and enhance performance. This paper introduces a novel algorithm that uses logarithmic prime numbers to efficiently sort data structures and remove duplicates. The algorithm is mathematically rigorous, ensuring correctness and providing a thorough analysis of its time complexity. To demonstrate its practicality and effectiveness, we compare our method with existing algorithms, highlighting its superior speed and accuracy. An extensive experimental analysis across one thousand random test problems shows that our approach significantly outperforms two alternative techniques from the literature. By discussing the potential applications of the proposed algorithm in various domains, including computer science, engineering, and data management, we illustrate its adaptability through two practical examples in which our algorithm solves the problem more than and times faster than the existing algorithms in the literature. The results of these examples demonstrate that the superiority of our algorithm becomes increasingly pronounced with larger problem sizes.- 23 August 2024
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 8 (9) , 96
Open AccessAn Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers
Data structures such as sets, lists, and arrays are fundamental in mathematics and computer science, playing a crucial role in numerous real-life applications. These structures represent a variety of entities, including solutions, conditions, and objectives. In scenarios involving large datasets, eliminating duplicate elements is essential to reduce complexity and enhance performance. This paper introduces a novel algorithm that uses logarithmic prime numbers to efficiently sort data structures and remove duplicates. The algorithm is mathematically rigorous, ensuring correctness and providing a thorough analysis of its time complexity. To demonstrate its practicality and effectiveness, we compare our method with existing algorithms, highlighting its superior speed and accuracy. An extensive experimental analysis across one thousand random test problems shows that our approach significantly outperforms two alternative techniques from the literature. By discussing the potential applications of the proposed algorithm in various domains, including computer science, engineering, and data management, we illustrate its adaptability through two practical examples in which our algorithm solves the problem more than and times faster than the existing algorithms in the literature. The results of these examples demonstrate that the superiority of our algorithm becomes increasingly pronounced with larger problem sizes. - 4 March 2024
- Published by Springer Nature in Photonic Network Communications
- Vol. 47 (2) , 97-105
Enhancing consecutiveness in elastic optical networks
- 4 March 2024
- Published by Springer Nature in Photonic Network Communications
- Vol. 47 (2) , 97-105
Enhancing consecutiveness in elastic optical networks
- Open Access
- 18 December 2023
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 10 (1) , 2-7
A simple algorithm for reliability evaluation of stochastic-flow networks under distance limitation
Various real-world systems, including computer and communication networks, trans- portation, and distribution systems, can be modeled as a stochastic/multistate flow network (MFN). Reliability indices are of great importance in evaluating the quality of service in MFNs. One such index is the two-terminal reliability (2TR), which represents the probability that the maximum flow in the network is not less than a certain demand level. Researchers have investigated the 2TR problem for MFNs, considering constraints such as budget, time, or distance limitations. Nevertheless, distance constraints have received relatively less attention in the literature, despite their significant role in optimizing the efficiency of some transmission networks. Hence, this study focuses on the 2TR problem with a distance constraint in an MFN and proposes a simple yet efficient algorithm to solve it. We demonstrate the effectiveness of our algorithm through a benchmark example.
- 18 December 2023
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 10 (1) , 2-7
Open AccessA simple algorithm for reliability evaluation of stochastic-flow networks under distance limitation
Various real-world systems, including computer and communication networks, trans- portation, and distribution systems, can be modeled as a stochastic/multistate flow network (MFN). Reliability indices are of great importance in evaluating the quality of service in MFNs. One such index is the two-terminal reliability (2TR), which represents the probability that the maximum flow in the network is not less than a certain demand level. Researchers have investigated the 2TR problem for MFNs, considering constraints such as budget, time, or distance limitations. Nevertheless, distance constraints have received relatively less attention in the literature, despite their significant role in optimizing the efficiency of some transmission networks. Hence, this study focuses on the 2TR problem with a distance constraint in an MFN and proposes a simple yet efficient algorithm to solve it. We demonstrate the effectiveness of our algorithm through a benchmark example.
- Open Access
- 6 December 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (24) , 4889
Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints
The quickest path problem in multistate flow networks, which is also known as the quickest path reliability problem (QPRP), aims at calculating the probability of successfully sending a minimum of d flow units/data/commodity from a source node to a destination node via one minimal path (MP) within a specified time frame of T units. Several exact and approximative algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all of the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under cost constraints and provides an efficient approach based on a node–child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute the complexity results, illustrate it through a benchmark example, and describe our extensive experimental results on one thousand randomly generated test problems and well-established benchmarks to showcase its practical superiority over the available algorithms in the literature.
- 6 December 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (24) , 4889
Open AccessUsing a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints
The quickest path problem in multistate flow networks, which is also known as the quickest path reliability problem (QPRP), aims at calculating the probability of successfully sending a minimum of d flow units/data/commodity from a source node to a destination node via one minimal path (MP) within a specified time frame of T units. Several exact and approximative algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all of the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under cost constraints and provides an efficient approach based on a node–child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute the complexity results, illustrate it through a benchmark example, and describe our extensive experimental results on one thousand randomly generated test problems and well-established benchmarks to showcase its practical superiority over the available algorithms in the literature.
- Open Access
- 13 November 2023
- Published by MDPI AG in Preprints.org
An Node-Child Matrix-Based Algorithm to the Quickest Path Reliability Problem under Transmission Cost Constraints
The quickest path problem in the multistate flow networks, also known as the quickest path reliability problem (QPRP), aims at calculating the probability of transmitting a minimum of d units of flow/dat/commodity from a source node to a destination node through one single path within T units of time. Several exact and approximation algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under the cost constraints and provides an efficient approach based on the node-child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute its complexity results, illustrate it through a benchmark example, and conduct extensive experimental results on the known benchmarks and one thousand randomly generated test problems to demonstrate its practical superiority compared to the existing algorithms in the literature.
- 13 November 2023
- Published by MDPI AG in Preprints.org
Open AccessAn Node-Child Matrix-Based Algorithm to the Quickest Path Reliability Problem under Transmission Cost Constraints
The quickest path problem in the multistate flow networks, also known as the quickest path reliability problem (QPRP), aims at calculating the probability of transmitting a minimum of d units of flow/dat/commodity from a source node to a destination node through one single path within T units of time. Several exact and approximation algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under the cost constraints and provides an efficient approach based on the node-child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute its complexity results, illustrate it through a benchmark example, and conduct extensive experimental results on the known benchmarks and one thousand randomly generated test problems to demonstrate its practical superiority compared to the existing algorithms in the literature.