A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
"September 1983."
Other Authors: | Orlin, James B., 1953-. |
---|---|
Language: | eng |
Published: |
Massachusetts Institute of Technology
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2058 |
Similar Items
-
On the simplex algorithm for networks and generalized networks
Published: (2003) -
A polynomial time primal network simplex algorithm for minimum cost flows
Published: (2003) -
Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem
by: Orlin, James B.
Published: (2009) -
New polynomial-time cycle-canceling algorithms for minimum cost flows
Published: (2003) -
A Faster Primal Network Simplex Algorithm
by: Aggarwal, Charu C., et al.
Published: (2004)