Maximum flow in hybrid network with intermediate storage
From MaRDI portal
Cites work
- A critical survey on the network optimization algorithms for evacuation planning problems
- A formula to calculate the variance of uncertain variable
- A new approach to the maximum-flow problem
- A sufficient and necessary condition of uncertainty distribution
- Abstract network flow with intermediate storage for evacuation planning
- Bounds on expected performance of networks with links subject to failure
- Bounds on the average terminal capacity of probabilistic nets (Corresp.)
- Continuous dynamic contraflow approach for evacuation planning
- Efficient continuous contraflow algorithms for evacuation planning problems
- Efficient contraflow algorithms for quickest evacuation planning
- scientific article; zbMATH DE number 3441964 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 3375221 (Why is no real title available?)
- Maximal Flow Through a Network
- Maximal, Lexicographic, and Dynamic Network Flows
- Network flow with intermediate storage: models and algorithms
- On distribution function of the diameter in uncertain graph
- Partial contraflow with path reversals for evacuation planning
- SOME PROPERTIES OF CONTINUOUS UNCERTAIN MEASURE
- The -maximum flow model with uncertain capacities
- The Distribution of Maximum Flow with Applications to Multistate Reliability Systems
- The maximum flow problem of uncertain network
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Theory and practice of uncertain programming.
- Uncertain random programming with applications
- Uncertain random variables: a mixture of uncertainty and randomness
- Uncertainty theory
This page was built for publication: Maximum flow in hybrid network with intermediate storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977230)
