A faster strongly polynomial minimum cost flow algorithm
Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/5073 |
| _version_ | 1826190997259812864 |
|---|---|
| author2 | Orlin, James B., 1953- |
| author_facet | Orlin, James B., 1953- |
| collection | MIT |
| description | Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88 |
| first_indexed | 2024-09-23T08:48:30Z |
| id | mit-1721.1/5073 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:48:30Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/50732019-04-10T19:10:27Z A faster strongly polynomial minimum cost flow algorithm Orlin, James B., 1953- Massachusetts Institute of Technology. Operations Research Center Q175.M41 O616 no.175-88 Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88 Includes bibliographical references (leaf 11). Supported by a National Science Foundation Presidential Young Investigator Grant. 8451517-ECS Supported by the Air Force Office of Scientific Research, Analog Devices, Apple Computer, and Prime Computer. by James B. Orlin. 2004-05-28T19:22:10Z 2004-05-28T19:22:10Z 1988 OR 175-88 http://hdl.handle.net/1721.1/5073 eng Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 175-88. Working paper (Sloan School of Management) ; 2042-88. 11 leaves 1368245 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Q175.M41 O616 no.175-88 A faster strongly polynomial minimum cost flow algorithm |
| title | A faster strongly polynomial minimum cost flow algorithm |
| title_full | A faster strongly polynomial minimum cost flow algorithm |
| title_fullStr | A faster strongly polynomial minimum cost flow algorithm |
| title_full_unstemmed | A faster strongly polynomial minimum cost flow algorithm |
| title_short | A faster strongly polynomial minimum cost flow algorithm |
| title_sort | faster strongly polynomial minimum cost flow algorithm |
| topic | Q175.M41 O616 no.175-88 |
| url | http://hdl.handle.net/1721.1/5073 |