An Improved Vectorization Algorithm to Solve the d-MP Problem

DOI10.5540/tcam.2022.024.01.00019zbMath1525.90098MaRDI QIDQ6088964

Majid Forghani-elahabad, Unnamed Author

Publication date: 14 December 2023

Published in: Trends in Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

network reliabilitystochastic-flow networkminimal-path problemvectorization techniques

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Multidimensional divide-and-conquer
• An improved algorithm for finding all upper boundary points in a stochastic-flow network
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• Parallel Programming
• Search for MC in modified networks
• Benchmarking optimization software with performance profiles.
• Unnamed Item

This page was built for publication: An Improved Vectorization Algorithm to Solve the d-MP Problem