A simplex algorithm for minimum-cost network-flow problems in infinite networks

Networks ◽  
2008 ◽  
Vol 52 (1) ◽  
pp. 14-31 ◽  
Author(s):  
Thomas C. Sharkey ◽  
H.Edwin Romeijn
Keyword(s):  
Network Flow ◽  
Minimum Cost ◽  
Simplex Algorithm ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Minimum Cost Network Flow ◽  
Infinite Networks

Heuristic solutions for general concave minimum cost network flow problems

Networks ◽  
2007 ◽  
Vol 50 (1) ◽  
pp. 67-76 ◽  
Author(s):  
Dalila B.M.M. Fontes ◽  
José Fernando Gonçalves
Keyword(s):  
Network Flow ◽  
Minimum Cost ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Minimum Cost Network Flow

scholarly journals Concave minimum cost network flow problems solved with a colony of ants

2012 ◽  
Vol 19 (1) ◽  
pp. 1-33 ◽  
Author(s):  
Marta S. R. Monteiro ◽  
Dalila B. M. M. Fontes ◽  
Fernando A. C. C. Fontes
Keyword(s):  
Network Flow ◽  
Minimum Cost ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Minimum Cost Network Flow

Upper bounds for single-source uncapacitated concave minimum-cost network flow problems

Networks ◽  
2003 ◽  
Vol 41 (4) ◽  
pp. 221-228 ◽  
Author(s):  
Dalila B. M. M. Fontes ◽  
Eleni Hadjiconstantinou ◽  
Nicos Christofides
Keyword(s):  
Network Flow ◽  
Minimum Cost ◽  
Upper Bounds ◽  
Single Source ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Minimum Cost Network Flow
Sign in / Sign up

Export Citation Format

Share Document