New distance-directed algorithms for maximum flow and parametric maximum flow problems

Παρόμοια τεκμήρια

• Computational investigations of maximum flow algorithms
  Έκδοση: (2003)
• Equivalence of primal and dual simplex algorithms for the maximum flow problem
  Έκδοση: (2003)
• A capacity scaling algorithm for the constrained maximum flow problem
  Έκδοση: (2003)
• On multi-route maximum flows in networks
  Έκδοση: (2003)
• An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope
  Έκδοση: (2003)