Login / Signup

Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.

Maiko ShigenoSatoru IwataS. Thomas McCormick
Published in: Math. Oper. Res. (2000)
Keyphrases
  • minimum cost flow
  • positive and negative
  • minimum cost
  • shortest path
  • computational efficiency
  • computational complexity
  • special case
  • worst case
  • optimization problems
  • branch and bound algorithm
  • bi objective