.png){kind=icon}
Return
Uncertain minimum cost flow problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-013-1194-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim of this paper is to give an uncertainty distribution of the least cost of shipment of a commodity through a network with uncertain capacities. Uncertainty theory is used to deal with uncertain capacities, and an -minimum cost flow problem model is proposed. After defining the -minimum cost flow, the properties of the model are analyzed, and then an algorithm for uncertain minimum cost flow problem is developed. The algorithm can be considered as a general solution to the uncertain minimum cost flow problem. To demonstrate the efficiency of the proposed algorithm, a numerical example is illustrated.
Keywords:
Minimum cost flow problem
Uncertainty theory
Uncertain programming
Network simplex algorithm
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveMechanical Properties of Fibre Reinforced Polymers under Elevated Temperatures: An Overview.png)
Polymers
OAAI
PolymersIF0
OAAIShareSaveShareSaveShareSave
View more