Login / Signup

Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources.

Steven CosaresDorit S. Hochbaum
Published in: Math. Oper. Res. (1994)
Keyphrases
  • fixed number
  • transportation problem
  • computational complexity
  • benchmark problems
  • combinatorial optimization
  • minimum cost flow
  • strongly polynomial