Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Includes bibliographical references (p. 15-16).
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Sloan School of Management, Massachusetts Institute of Technology
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/2626 |
| _version_ | 1826214991414427648 |
|---|---|
| author2 | Goldfarb, Donald. |
| author_facet | Goldfarb, Donald. |
| collection | MIT |
| description | Includes bibliographical references (p. 15-16). |
| first_indexed | 2024-09-23T16:14:32Z |
| id | mit-1721.1/2626 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T16:14:32Z |
| publishDate | 2003 |
| publisher | Sloan School of Management, Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/26262019-04-11T09:45:22Z Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem Goldfarb, Donald. Jin, Zhiying. Orlin, James B., 1953-. HD28 .M414 no.3909-96 Includes bibliographical references (p. 15-16). Supported in part by NSF. DMS 94-14438 DMS 95-27124 Supported in part by DOE. DE-FG02-92ER25126 Supported as well by grants from UPS and ONR. N00014-96-1-0051 by Donald Goldfarb, Zhiying Jin, James B. Orlin. 2003-04-29T05:13:37Z 2003-04-29T05:13:37Z 1996 #3909-96 http://hdl.handle.net/1721.1/2626 eng Working paper (Sloan School of Management) ; 3909-96. 16 p. 1177143 bytes application/pdf application/pdf Sloan School of Management, Massachusetts Institute of Technology |
| spellingShingle | HD28 .M414 no.3909-96 Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem |
| title | Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem |
| title_full | Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem |
| title_fullStr | Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem |
| title_full_unstemmed | Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem |
| title_short | Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem |
| title_sort | polynomial time highest gain augmenting path algorithms for the generalized circulation problem |
| topic | HD28 .M414 no.3909-96 |
| url | http://hdl.handle.net/1721.1/2626 |