Login / Signup

A new strongly polynomial dual network simplex algorithm.

Ronald D. ArmstrongZhiying Jin
Published in: Math. Program. (1997)
Keyphrases
  • minimum cost flow
  • network simplex algorithm
  • strongly polynomial
  • bi objective
  • shortest path
  • minimum cost
  • shortest path algorithm
  • efficient solutions
  • special case
  • network flow