M. Forghani-elahabad

An Efficient Algorithm for the Quickest Path Reliability Problem

The quickest path reliability problem is to compute the probability that a given flow is transmitted along a single source-destination path within a given time limit. When a budget is imposed, path feasibility is jointly dependent on lead time, transmission cost, and capacity. Existing exact methods may require enumera...