Login / Signup

Minimum cost routing for dynamic network models.

Bernard Yaged Jr.
Published in: Networks (1973)
Keyphrases
  • minimum cost
  • network flow
  • network flow problem
  • spanning tree
  • network topologies
  • np hard
  • dynamic environments
  • computer networks
  • lower bound
  • upper bound
  • complex networks
  • lot sizing
  • random graphs
  • dynamic routing