A minimum concave-cost dynamic network flow problem with an application to lot-sizing

Networks ◽  
1985 ◽  
Vol 15 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Stephen C. Graves ◽  
James B. Orlin
Keyword(s):  
Network Flow ◽  
Flow Problem ◽  
Lot Sizing ◽  
Dynamic Network ◽  
Network Flow Problem ◽  
Dynamic Network Flow ◽  
Concave Cost ◽  
Dynamic Network Flow Problem

A composite algorithm for a concave-cost network flow problem

Networks ◽  
1989 ◽  
Vol 19 (2) ◽  
pp. 175-202 ◽  
Author(s):  
Anantharam Balakrishnan ◽  
Stephen C. Graves
Keyword(s):  
Network Flow ◽  
Flow Problem ◽  
Network Flow Problem ◽  
Concave Cost

A deterministic annealing algorithm for the minimum concave cost network flow problem

2011 ◽  
Vol 24 (7) ◽  
pp. 699-708 ◽  
Author(s):  
Chuangyin Dang ◽  
Yabin Sun ◽  
Yuping Wang ◽  
Yang Yang
Keyword(s):  
Network Flow ◽  
Flow Problem ◽  
Deterministic Annealing ◽  
Network Flow Problem ◽  
Concave Cost ◽  
Annealing Algorithm
Sign in / Sign up

Export Citation Format

Share Document