Login / Signup

Finding minimum-cost flows by double scaling.

Ravindra K. AhujaAndrew V. GoldbergJames B. OrlinRobert Endre Tarjan
Published in: Math. Program. (1992)
Keyphrases
  • minimum cost
  • np hard
  • spanning tree
  • network flow problem
  • network flow
  • network simplex algorithm
  • approximation algorithms
  • capacity constraints
  • minimum cost flow
  • search algorithm