Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   AMIRKABIR   FALL 2007- WINTER 2008 , Volume 18 , Number 67-E; Page(s) 7 To 15.
 
Paper: 

MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW

 
 
Author(s):  SALEHI FATHABADI H., RAYAT PANAH M.A.
 
* 
 
Abstract: 
In this paper the minimum cost flow problem with additional linear constraints on some arcs' flows has been considered. The additional constraints show that the flow on arcs which are belonged to specific subsets of arcs have to be linearly depended on the flow on a specific arc(called reference arc) in the subset. Since the basis structure in this problem is not a spanning tree, we introduce a basis spanning graph and call it a good (q+1)-forest for the problem. Then by regarding the optimality conditions, we restructure the network simplex algorithm to solve the above problem.
 
Keyword(s): NETWORK FLOW, NETWORK SIMPLEX ALGORITHM, BASE TREE, INCIDENCE MATRIX
 
 
References: 
  • Not Registered.
  •  
  •  
 
Citations: 
  • Not Registered.
 
+ Click to Cite.
APA: Copy

SALEHI FATHABADI, H., & RAYAT PANAH, M. (2008). MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW. AMIRKABIR, 18(67-E), 7-15. https://www.sid.ir/en/journal/ViewPaper.aspx?id=104830



Vancouver: Copy

SALEHI FATHABADI H., RAYAT PANAH M.A.. MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW. AMIRKABIR. 2008 [cited 2021June14];18(67-E):7-15. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=104830



IEEE: Copy

SALEHI FATHABADI, H., RAYAT PANAH, M., 2008. MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW. AMIRKABIR, [online] 18(67-E), pp.7-15. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=104830.



 
 
Persian Abstract Yearly Visit 37
 
 
Latest on Blog
Enter SID Blog