An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method
From MaRDI portal
Publication:2792202
DOI10.1080/00207721.2013.879228zbMath1332.93372OpenAlexW2075726733MaRDI QIDQ2792202
Publication date: 8 March 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2013.879228
Cites Work
- A gradient-based transformation method in multidisciplinary design optimization
- The quickest path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- On the quickest path problem
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- An algorithm for the quickest path problem
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- A comprehensive survey on the quickest path problem
- A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
- Handbook of Graph Theory
- Study on the multicommodity reliability of a capacitated-flow network
This page was built for publication: An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method