Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Includes bibliographical references (p. 15-16).
Year of publication: |
1996
|
---|---|
Authors: | Goldfarb, Donald. ; Jin, Zhiying. ; Orlin, James B. |
Institutions: | Sloan School of Management, Massachusetts Institute of Technology (MIT) |
Subject: | HD28 .M414 no.3909-96 |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Use of representative operation counts in computational testings of algorithms
Ahuja, Ravindra K., (1992)
-
Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems
Safer, Hershel M., (1995)
-
On a "primal" matroid intersection algorithm
Orlin, James B., (1983)
- More ...