Parallel algorithms for the assignment and minimum-cost flow problems
Includes bibliographical references (p. 8-9).
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992.
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/2418 |
| _version_ | 1826214570764533760 |
|---|---|
| author2 | Orlin, James B., 1953-. |
| author_facet | Orlin, James B., 1953-. |
| collection | MIT |
| description | Includes bibliographical references (p. 8-9). |
| first_indexed | 2024-09-23T16:07:53Z |
| id | mit-1721.1/2418 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T16:07:53Z |
| publishDate | 2003 |
| publisher | Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992. |
| record_format | dspace |
| spelling | mit-1721.1/24182019-04-12T08:24:07Z Parallel algorithms for the assignment and minimum-cost flow problems Orlin, James B., 1953-. Stein, Clifford. HD28 .M414 no.3440-, 92 Includes bibliographical references (p. 8-9). Supported by NSF. DDM-8921835 Supported by the Air Force Office of Scientific Research. AFOSR-88-0088 Supported by a NSF PYI award, with matching support from UPS and Sun. CCR-89-96272 Supported by an AT&T Bell Laboratories Graduate Fellowship. James B. Orlin and Clifford Stein. 2003-04-29T05:07:02Z 2003-04-29T05:07:02Z 2003-04-29T05:07:02Z #3440-92-MSA http://hdl.handle.net/1721.1/2418 eng Working paper (Sloan School of Management) ; 3440-92. 9 p. 674358 bytes application/pdf application/pdf Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992. |
| spellingShingle | HD28 .M414 no.3440-, 92 Parallel algorithms for the assignment and minimum-cost flow problems |
| title | Parallel algorithms for the assignment and minimum-cost flow problems |
| title_full | Parallel algorithms for the assignment and minimum-cost flow problems |
| title_fullStr | Parallel algorithms for the assignment and minimum-cost flow problems |
| title_full_unstemmed | Parallel algorithms for the assignment and minimum-cost flow problems |
| title_short | Parallel algorithms for the assignment and minimum-cost flow problems |
| title_sort | parallel algorithms for the assignment and minimum cost flow problems |
| topic | HD28 .M414 no.3440-, 92 |
| url | http://hdl.handle.net/1721.1/2418 |