Login / Signup

Extreme point characterizations for infinite network flow problems.

H. Edwin RomeijnDushyant SharmaRobert L. Smith
Published in: Networks (2006)
Keyphrases
  • network flow problem
  • minimal cost
  • network design problem
  • minimum cost
  • network simplex algorithm
  • np hard
  • network flow
  • mixed integer
  • special case
  • scheduling problem
  • linear program
  • fixed charge