Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Includes bibliographical references (p. 28-29).
Other Authors: | Freund, Robert M. |
---|---|
Language: | eng |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/5245 |
Similar Items
-
A faster strongly polynomial minimum cost flow algorithm
Published: (2004) -
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Published: (2003) -
Projective transformations for interior point methods, Part I: Basic Theory and Linear Programming
Published: (2004) -
New scaling algorithms for the assignment for minimum cycle mean problems
Published: (2004) -
Implementing primal-dual network flow algorithms
Published: (2004)