Login / Signup
Time-varying minimum cost flow problems.
Xiaoqiang Cai
Dan Sha
C. K. Wong
Published in:
Eur. J. Oper. Res. (2001)
Keyphrases
</>
minimum cost flow
strongly polynomial
bi objective
neural network
benchmark problems
network simplex algorithm
optimal solution
np complete
shortest path