The \(\alpha\)-maximum flow model with uncertain capacities

DOI10.1016/j.apm.2014.10.021zbMath1443.90338OpenAlexW1998153509MaRDI QIDQ2338453

Sibo Ding

Publication date: 21 November 2019

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.10.021

zbMATH Keywords

uncertainty theoryuncertain programmingmaximum flow problemgeneric preflow-push algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (6)

A belief degree-based uncertain scheme for a bi-objective two-stage green supply chain network design problem with direct shipment ⋮ Risk‐averse optimization and resilient network flows ⋮ Solving geometric programming problems with normal, linear and zigzag uncertainty distributions ⋮ Unnamed Item ⋮ Impact of compressor failures on gas transmission network capability ⋮ Uncertain multi-objective Chinese postman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Euler index in uncertain graph
• Shortest path problem with uncertain arc lengths
• The maximum flow problem of uncertain network
• Uncertain hypothesis testing for two experts' empirical data
• Theory and practice of uncertain programming.
• Bounds on expected performance of networks with links subject to failure
• CONNECTEDNESS INDEX OF UNCERTAIN GRAPH
• Maximum flows in probabilistic networks
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A sufficient and necessary condition of uncertainty distribution
• Bounds on the average terminal capacity of probabilistic nets (Corresp.)
• Uncertainty theory

This page was built for publication: The \(\alpha\)-maximum flow model with uncertain capacities