A polynomial time primal network simplex algorithm for minimum cost flows
Cover title.
Other Authors: | Orlin, James B., 1953- |
---|---|
Language: | eng |
Published: |
Sloan School of Management, Massachusetts Institute of Technology]
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2584 |
Similar Items
-
A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
Published: (2003) -
Equivalence of primal and dual simplex algorithms for the maximum flow problem
Published: (2003) -
New polynomial-time cycle-canceling algorithms for minimum cost flows
Published: (2003) -
A faster strongly polynomial minimum cost flow algorithm
Published: (2003) -
A faster strongly polynomial minimum cost flow algorithm
Published: (2003)