Login / Signup

Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs.

Balachandran Vaidyanathan
Published in: Networks (2013)
Keyphrases
  • transportation problem
  • optimization problems
  • strongly polynomial
  • lower bound
  • fixed charge
  • minimum cost flow