Login / Signup
A note on asymptotic formulae for one-dimensional network flow problems.
Carlos F. Daganzo
Karen R. Smilowitz
Published in:
Ann. Oper. Res. (2006)
Keyphrases
</>
network flow problem
minimum cost
network flow
minimal cost
network simplex algorithm
fixed charge
network design problem
np hard
mixed integer
approximation algorithms
worst case
optimization model
transportation problem
social networks
branch and bound
dynamic systems