Author/Authors :
Yi-Kuei Lin، نويسنده , , John Yuan، نويسنده ,
Abstract :
This article mainly generalizes the flow (or transportation) reliability problem for a directed capacitated-flow network in which the capacity of each arc ai has the values 0<1<2<
Keywords :
Multiple node pairs , Maximal flow , Capacity , Minimal path , probability , reliability
Journal title :
Computers & Industrial Engineering
Journal title :
Computers & Industrial Engineering