An efficient alternative to the exact evaluation of the quickest path flow network reliability problem

@article{Khadiri2016AnEA,
  title={An efficient alternative to the exact evaluation of the quickest path flow network reliability problem},
  author={Mohamed El Khadiri and Wei-Chang Yeh},
  journal={Computers & OR},
  year={2016},
  volume={76},
  pages={22-32}
}
In this paper we consider the evaluation of the probability that a stochastic flow network allows the transmission of a given amount of flow through one path, connecting the source and the sink node, within a fixed amount of time. This problem, called the quickest path flow network reliability problem, belongs to the NP-hard family. This implies that no polynomial algorithm is known for solving it exactly in a CPU runtime bounded by a polynomial function of the network size. As an alternative… CONTINUE READING