A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Graph Algorithms
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Adjustable robust solutions of uncertain linear programs
Mathematical Programming: Series A and B
Theory and Practice of Uncertain Programming
Theory and Practice of Uncertain Programming
Communication: Robust network optimization under polyhedral demand uncertainty is NP-hard
Discrete Applied Mathematics
Existence and uniqueness theorem for uncertain differential equations
Fuzzy Optimization and Decision Making
Chance constrained maximum flow problem with fuzzy arc capacities
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
Shortest path problem with uncertain arc lengths
Computers & Mathematics with Applications
Cross-entropy measure of uncertain variables
Information Sciences: an International Journal
No-arbitrage determinant theorems on mean-reverting stock model in uncertain market
Knowledge-Based Systems
Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty
Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty
Some stability theorems of uncertain differential equation
Fuzzy Optimization and Decision Making
| Hi-index | 0.07 |
The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. The main purpose of this paper is to solve the maximum flow in an uncertain network by under the framework of uncertainty theory.