Equivalence of primal and dual simplex algorithms for the maximum flow problem
Cover title.
Other Authors: | Ahuja, Ravindra K., 1956- |
---|---|
Language: | eng |
Published: |
Sloan School of Management, Massachusetts Institute of Technology]
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2609 |
Similar Items
-
A polynomial time primal network simplex algorithm for minimum cost flows
Published: (2003) -
New polynomial-time cycle-canceling algorithms for minimum cost flows
Published: (2003) -
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Published: (2003) -
Generalized models of design iteration using signal flow graphs
Published: (2003) -
New distance-directed algorithms for maximum flow and parametric maximum flow problems
Published: (2003)