A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
"September 1983."
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/2058 |
| _version_ | 1826211259388788736 |
|---|---|
| author2 | Orlin, James B., 1953-. |
| author_facet | Orlin, James B., 1953-. |
| collection | MIT |
| description | "September 1983." |
| first_indexed | 2024-09-23T15:03:07Z |
| id | mit-1721.1/2058 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T15:03:07Z |
| publishDate | 2003 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/20582019-04-10T21:56:36Z A polynomial-time parametric simplex algorithm for the minimum cost network flow problem Orlin, James B., 1953-. Sloan School of Management. HD28 .M414 no.1484-, 83 Simplexes (Mathematics) Algorithms "September 1983." Bibliography: p. [15] James B. Orlin. 2003-04-29T04:56:10Z 2003-04-29T04:56:10Z 1983 Sloan W.P, No. 1484-83 http://hdl.handle.net/1721.1/2058 eng Working paper (Sloan School of Management) ; 1484-83. 14, [1] p. : ill. 860059 bytes application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | HD28 .M414 no.1484-, 83 Simplexes (Mathematics) Algorithms A polynomial-time parametric simplex algorithm for the minimum cost network flow problem |
| title | A polynomial-time parametric simplex algorithm for the minimum cost network flow problem |
| title_full | A polynomial-time parametric simplex algorithm for the minimum cost network flow problem |
| title_fullStr | A polynomial-time parametric simplex algorithm for the minimum cost network flow problem |
| title_full_unstemmed | A polynomial-time parametric simplex algorithm for the minimum cost network flow problem |
| title_short | A polynomial-time parametric simplex algorithm for the minimum cost network flow problem |
| title_sort | polynomial time parametric simplex algorithm for the minimum cost network flow problem |
| topic | HD28 .M414 no.1484-, 83 Simplexes (Mathematics) Algorithms |
| url | http://hdl.handle.net/1721.1/2058 |