The maximum flow problem of uncertain network
type: Item
instance of: scholarly article
title: The maximum flow problem of uncertain network
zbMATH Open document ID: 1328.90018
author: Zixiong Peng
author: Shengwei Han
author: Shunqin Wang
published in: Information Sciences
publication date: 2016-01-14T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C70
zbMATH DE Number: 6530507
zbMATH Keywords: network flow
zbMATH Keywords: maximum flow problem
zbMATH Keywords: maximum flow function
zbMATH Keywords: uncertainty theory
zbMATH Keywords: uncertain variable
MaRDI profile type: Publication
full work available at URL: j.ins.2013.11.029
OpenAlex ID: W2138322984
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Delbert Ray Fulkerson (August 14, 1924–January 10, 1976)
cites work: Maximum flow in a network with fuzzy arc capacities
cites work: Real-valued flows in a network with fuzzy arc capacities
cites work: Integer flows in network with fuzzy capacity constraints
cites work: Existence and uniqueness theorem for uncertain differential equations
cites work: Cross-entropy measure of uncertain variables
cites work: Q5624995
cites work: Q3883524
cites work: The Distribution of Maximum Flow with Applications to Multistate Reliability Systems
cites work: Maximal Flow Through a Network
cites work: Q3292914
cites work: Shortest path problem with uncertain arc lengths
cites work: Uncertain models for single facility location problems on networks
cites work: A new approach to the maximum-flow problem
cites work: The symbolic algorithms for maximum flow in networks
cites work: Q4058442
cites work: Uncertainty theory
cites work: Theory and practice of uncertain programming.
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: The maximum flow problem: A max-preflow approach
cites work: On robust maximum flow with polyhedral uncertainty sets
cites work: Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
cites work: Robust capacity expansion of network flows
cites work: A sufficient and necessary condition of uncertainty distribution
cites work: Q4538163
cites work: The maximum flow problem with fuzzy constraints
cites work: Algorithms for maximum network flow
cites work: Some stability theorems of uncertain differential equation
DOI: 10.1016/J.INS.2013.11.029
description: scientific article; zbMATH DE number 6530507