An Improved Vectorization Algorithm to Solve the d-MP Problem

DOI10.5540/TCAM.2022.024.01.00019MaRDI QIDQ6088964zbMATH OpenFDO

Authors Majid Forghani-elahabad

Publication date 14 December 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5540/TCAM.2022.024.01.00019

zbMATH Keywords

network reliabilitystochastic-flow networkminimal-path problemvectorization techniques

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 53772 (Why is no real title available?)
• An improved algorithm for finding all upper boundary points in a stochastic-flow network
• Benchmarking optimization software with performance profiles.
• Multidimensional divide-and-conquer
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• Parallel Programming
• Search for MC in modified networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6088964)