Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
type: Item
instance of: scholarly article
title: Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
zbMATH Open document ID: 1402.90041
author: Chin-Chia Jane
author: Yih-Wenn Laih
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 60K30
zbMATH DE Number: 6873657
zbMATH Keywords: applied probability
zbMATH Keywords: distribution
zbMATH Keywords: reliability
zbMATH Keywords: transit time
zbMATH Keywords: multi-state flow network
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.12.030
OpenAlex ID: W2564452081
cites work: A survey of dynamic network flows
cites work: The quickest flow problem
cites work: Internet packet routing: application of a \(K\)-quickest path algorithm
cites work: Finding the \(k\) quickest simple paths in a network
cites work: The quickest path problem
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
cites work: Q4737515
cites work: Q3292914
cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths
cites work: PERMUTATIONAL METHODS FOR PERFORMANCE ANALYSIS OF STOCHASTIC FLOW NETWORKS
cites work: A new approach to the maximum-flow problem
cites work: Q2776597
cites work: The quickest transshipment problem
cites work: A dynamic bounding algorithm for approximating multi-state two-terminal reliability
cites work: Evaluating cost and reliability integrated performance of stochastic logistics systems
cites work: Reliability evaluation of a limited-flow network in terms of minimal cutsets
cites work: A sum of disjoint products algorithm for reliability evaluation of flow networks
cites work: The all-pairs quickest path problem
cites work: On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
cites work: On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
cites work: Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
cites work: Fast and fine quickest path algorithm
DOI: 10.1016/J.EJOR.2016.12.030
description: scientific article; zbMATH DE number 6873657